#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;

ll n,m;
vector<ll> vec;
vector<int> cnts;

int main(void){
	scanf("%lld%lld",&n,&m);
	ll mp=m;
	for(ll i=2;i*i<=n;i++){
		if(mp%i==0LL){
			vec.push_back(i);
			cnts.push_back(0);
			while(mp%i==0LL){
				cnts[cnts.size()-1]++;
				mp/=i;
			}
		}
	}
	if(mp!=1LL){
		vec.push_back(mp);
		cnts.push_back(1);
	}
	ll cnt=0;
	ll np=n;
	int pp=1;
	for(int i=0;i<vec.size();i++){
		ll now=vec[i];
		ll tmp=0;
		while(1){
			tmp+=n/now;
			if(n/now<vec[i])break;
			now*=vec[i];
		}
		tmp/=(ll)cnts[i];
		if(i==0)cnt=tmp;
		else cnt=min(cnt,tmp);
	}
	long double sum=lgammal(n+1LL);
	sum/=log(10);
	long double nex=log10l(m);
	sum-=(long double)nex*cnt;
	ll resp=sum;
	double rest=(long double)sum-resp;
	printf("%.5fe%lld\n",pow(10,rest),resp);
	return 0;
}