  # Python | sympy.divisor_count () method

Python Methods and Functions

Using the sympy.divisor_count () method, we can count the number of divisors of a given integer.

Syntax: divisor_count (n, modulus = 1)

Parameter:
n - It denotes an integer.
modulus - It is set to 1 by default. If modulus is not 1 then only those that are divisible by modulus are counted.

Returns: Returns the count of divisors of the given number.

Example # 1:

 ` # import divisor_count () method from sympy ` ` from ` ` sympy ` ` import ` ` divisor_count `   ` n ` ` = ` ` 84 `   ` # Use the divisor_count () method ` ` divisor_count_n ` ` = ` ` divisor_count (n) ` ` `  ` print ` ` (` `" The number of divisors of {}: {} "` `. ` ` format ` ` (n, divisor_count_n)) `

Exit:

``` The number of divisors of 84: 12    Example # 2:            ` # import divisor_count () method from sympy `   ` from ` ` sympy ` ` import ` ` divisor_count `     ` n ` ` = ` ` 12 `   ` `  ` # Use the divisor_count () method `   ` diviso r_count_n ` ` = ` ` divisor_count (n, modulus ` ` = ` ` 2 ` `) `     ` print ` ` (` ` "The number of divisors of {}: {}"  .   format   (n, divisor_count_n))  ``  `        Exit:  The number of divisors of 12: 4