#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main(){
  int N;
  long long M;
  cin >> N >> M;
  vector<pair<long long, int>> F;
  for (long long i = 2; i * i <= M; i++){
    if (M % i == 0){
      int cnt = 0;
      while (M % i == 0){
        cnt++;
        M /= i;
      }
      F.push_back(make_pair(i, cnt));
    }
  }
  if (M > 1){
    F.push_back(make_pair(M, 1));
  }
  int cnt = F.size();
  long long ans = 1;
  for (int i = 0; i < cnt; i++){
    int e = F[i].second;
    vector<vector<long long>> dp(N, vector<long long>(e + 1, 0));
    for (int j = 0; j <= e; j++){
      dp[0][j] = 1;
    }
    for (int j = 0; j < N - 1; j++){
      long long S = 0;
      for (int k = e; k >= 0; k--){
        S += dp[j][e - k];
        if (S >= MOD){
          S -= MOD;
        }
        dp[j + 1][k] = S;
      }
    }
    long long m = 0;
    for (int j = 0; j <= e; j++){
      m += dp[N - 1][j];
      m %= MOD;
    }
    ans *= m;
    ans %= MOD;
  }
  cout << ans << endl;
}