#include <iostream>
#include <fstream>
using namespace std;
ifstream in("gfact.in");
ofstream out("gfact.out");
#define ll long long
ll mx;
int p, q;
ll putere(ll n, ll divizor)
{
    ll rez = 0;
    ll x = divizor;
    while(x <= n)
    {
        rez += n / x;
        x *= divizor;
    }
    return rez;
}

ll aflare(ll nr, ll put)
{
    ll st = 1;
    ll dr = put;
    while(st < dr)
    {
        ll mij = (st + dr) / 2;
        if(putere(nr * mij, nr) < put)
            st = mij + 1;
        else
            dr = mij;
    }
    return dr * nr;
}

int main()
{
    in >> p >> q;
    ll put;
    ll copie = p;
    for(int i = 2; 1LL * i * i <= copie && p > 1; i++)
    {
        if(p % i == 0)
        {
            put = 0;
            while(p % i == 0)
            {
                put++;
                p /= i;
            }
            mx = max(mx, aflare(i, put * q));
        }
    }
    if(p > 1)
        mx = aflare(p, q);
    out << mx << "\n";
    return 0;
}