#include <algorithm>
#include <vector>
using namespace std;

#define x first
#define y second
#define pb push_back
#define mp make_pair
#define ll long long

vector <pair <ll,ll> > v;
ll p,q,n,nrt;

void init ()
{
    ll i,put;

    for (i=2; i*i<=p; )
    {
        if (p%i==0)
        {
            for (put=0; p%i==0; p/=i, ++put);
            v.pb (mp (i,put*q));
        }
        if (i==2)
            ++i;
        else
            i+=2;
    }
    if (p)
        v.pb (mp (p,q));
}

inline ll det (ll nr,ll prim)
{
    ll x;

    for (x=0; nr; x+=(nr/=prim));
    return x;
}

inline ll cbin (ll prim,ll put)
{
    ll st,dr,mij,nr;

    for (st=1, dr=put; st<=dr; )
    {
        mij=(st+dr)/2;
        nr=det (mij,prim)+mij;
        if (nr==put)
            return mij;
        else if (nr<put)
            st=mij+1;
        else
            dr=mij-1;
    }
    return 0;
}

void solve ()
{
    ll i;

    for (i=0; i<(int)v.size (); ++i)
        nrt=max (nrt,cbin (v[i].x,v[i].y)*v[i].x);
    printf ("%lld",nrt);
}

int main ()
{
    freopen ("gfact.in","r",stdin);
    freopen ("gfact.out","w",stdout);

    scanf ("%lld%lld",&p,&q);
    init ();
    if (p==1)
        nrt=1;
    solve ();
    
    return 0;
}