#include <stdio.h>
#define N 100000005   
long long p,q;
void citire()
{
	scanf("%lld%lld",&p,&q);
}
bool prim(long long n)   
{   
    long long i;   
    if (n<2)   
        return false;   
    if (n==2)   
        return true;   
    if (n%2==0)   
        return false;   
    for (i=3; i*i<=n; i+=2)   
        if (n%i==0)   
            return false;   
    return true;   
}   
long long fact(long long p,long long q)
{
	long long s=0,i;
	for (i=q; i<=p; i*=q)
		s+=p/i;
	return s;
}
long long calcul(long long r,long long k)
{
	long long st=1,dr=r*k,m,x;
	while (st!=dr)
	{
		m=(long double)st/2+(long double)dr/2;
		x=fact(m,k);
		if (x==r)
			return m/k*k;
		else
			if (x<r)
				st=m+1;
			else
				dr=m;
	}
	return st;
}
void desc()
{
	long long i,putere;
	long long nr=0,max=0;
	if (prim(p) && q==1)
		printf("%lld",p);
	else
	{
	for (i=2; i*i<=p ;i++)
		if (p%i==0)
		{
			putere=0;
			while (p%i==0)
			{
				p/=i;
				putere++;
			}
			nr=calcul(putere*q,i);
			if (nr>max)
				max=nr;
		}
	if (p!=1)
	{
		nr=calcul(1*q,p);
			if (nr>max)
				max=nr;
	}
	printf("%lld",max);
	}
}
int main()
{
	freopen("gfact.in","r",stdin);
	freopen("gfact.out","w",stdout);
	citire();
	desc();
	return 0;
}