def divisor_count(n, modulus=1):

    if not modulus:
        return 0
    elif modulus != 1:
        n, r = divmod(n, modulus)
        if r:
            return 0
    if n == 0:
        return 0
    return Mul(*[v + 1 for k, v in factorint(n).items() if k > 1])
Return the number of divisors of ``n``. If ``modulus`` is not 1 then only
dataset/ETHPy150Open sympy/sympy/sympy/ntheory/factor_.py/divisor_count