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

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

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

void init ()
{
    int i,put;

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

int det (int nr,int prim)
{
    int x;

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

int cbin (int prim,int put)
{
    int 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 ()
{
    int i;

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

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

    scanf ("%d%d",&p,&q);
    init ();
    solve ();
    return 0;
}