#include <fstream>
#include <climits>
#include <cmath>

using namespace std;

ifstream fin("gfact.in");
ofstream fout("gfact.out");

long long Div[50005];
int p, q;

bool test(long long val)
{
    int r = sqrt(p) + 1;
    for(int i = 2; i <= r; ++i)
    {
        if(Div[i] >= 1)
        {
            long long rez = 0;
            int p = i;
            while(val / p != 0){
                rez += val / p;
                p *= i;
            }
            if(rez < Div[i])
                return 0;
        }
    }
    return 1;
}

int main()
{
    fin >> p >> q;

    int d = 2;
    int cp = p;
    while(p > 1)
    {
        int e = 0;
        while(p % d == 0)
        {
            ++e;
            p /= d;
        }

        Div[d] = e * q;
        ++d;
    }
    p = cp;

    long long rez = 0;
    long long st = 1;
    long long dr = INT_MAX;
    while(st <= dr)
    {
        long long mij = (st + dr) / 2;
        if(test(mij))
        {
            rez = mij;
            dr = mij - 1;
        }
        else st = mij + 1;
    }
    fout << rez << '\n';
    return 0;
}