#include <bits/stdc++.h>

using namespace std;

long long calc(long long x, long long n) {
    return max(min(n, x - 1) - max(1LL, x - n) + 1, 0LL);
}

int main() {
    long long n, k;
    long long ans = 0;
    for (long long i = 2; i * i <= k; i++) {
        if (k % i != 0) continue;
        long long x = k / i;
        long long hoge=calc(i,n)*calc(x,n);
        if (x != i) hoge*=2;
        ans+=hoge;
    }
    cout<<ans<<endl;
    return 0;
}