#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 2000100;
int vis[N], pri[N], is[N], tot = 0, n, m, q;
long long jc[N], inv[N], ans;
long long ksm(long long x, int y) {
  long long res = 1;
  while (y) {
    if (y & 1) res = (res * x) % mod;
    x = (x * x) % mod;
    y >>= 1;
  }
  return res;
}
void ycl() {
  int i, j;
  for (i = 2; i <= 1000000; i++) {
    if (!vis[i]) {
      pri[++tot] = i;
      is[i] = i;
    }
    for (j = 1; ((i * pri[j] <= 1000000) && (j <= tot)); j++) {
      vis[i * pri[j]] = 1;
      is[i * pri[j]] = pri[j];
      if (i % pri[j] == 0) break;
    }
  }
  jc[0] = 1;
  for (i = 1; i <= 2000000; i++) jc[i] = (jc[i - 1] * (long long)i) % mod;
  inv[0] = 1;
  inv[2000000] = ksm(jc[2000000], mod - 2);
  for (i = 1999999; i; i--) inv[i] = (inv[i + 1] * (long long)(i + 1)) % mod;
}
long long C(int n, int m) {
  return ((jc[n] * inv[m]) % mod * inv[n - m]) % mod;
}
int main() {
  int i, j, k, x, cnt;
  long long tmp;
  ycl();
  scanf("%d", &q);
  while (q--) {
    scanf("%d%d", &n, &m);
    ans = 1;
    while (m != 1) {
      x = is[m];
      cnt = 0;
      while (m % x == 0) cnt++, m /= x;
      if (!n)
        ans = (ans * 2) % mod;
      else {
        tmp = (2 * C(cnt + n, n)) % mod;
        tmp = (tmp - C(cnt + n - 1, n - 1) + mod) % mod;
        ans = (ans * tmp) % mod;
      }
    }
    printf("%I64d\n", ans);
  }
  return 0;
}
