#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<long long> divisor(long long n) {
    vector<long long> ret;
    for (long long i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            ret.push_back(i);
            if (i * i != n) ret.push_back(n / i);
        }
    }
    sort(ret.begin(), ret.end()); // 昇順に並べる
    return ret;
}
int main() {
    ll A, B;
    cin >> A >> B;
    vector<ll> C = divisor(A);
    ll ans = 0;
    for(ll x : C) {
        if(!(x%B)) ans++;
    }
    cout << ans << endl;
}