(n, modulus=1)
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
    those that are divisible by ``modulus`` are counted.

    References
    ==========

    - http://www.mayer.dial.pipex.com/maths/formulae.htm

    >>> from sympy import divisor_count
    >>> divisor_count(6)
    4

    See Also
    ========

    factorint, divisors, totient
Return the number of divisors of ``n``. If ``modulus`` is not 1 then only
    those that are divisible by ``modulus`` are counted.
Return the number of divisors of n . If modulus is not 1 then only those that are divisible by modulus are counted .
def divisor_count(n, modulus=1):
    """
    Return the number of divisors of ``n``. If ``modulus`` is not 1 then only
    those that are divisible by ``modulus`` are counted.

    References
    ==========

    - http://www.mayer.dial.pipex.com/maths/formulae.htm

    >>> from sympy import divisor_count
    >>> divisor_count(6)
    4

    See Also
    ========

    factorint, divisors, totient
    """

    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])
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 ] )