Skip to content
Formula

Number of divisors from the prime factorisation

Arithmetic • Number System • Factors and Divisors

Formula

If with distinct primes , every positive divisor of is with each chosen independently, so has exactly positive divisors, and included.

How to use it

  1. 1Factorise into prime powers first; the count needs the exponents, not the primes.
  2. 2Add one to each exponent, since a prime may also be absent from a divisor, and multiply.
  3. 3The count includes and ; take them off if only proper or non-trivial divisors are wanted.
  4. 4The count is odd exactly when is a perfect square.

Worked example

How many positive divisors does have?

Step-by-step

  1. 1
  2. 2

    Why: Each divisor picks a power of from choices, of from and of from , independently.

Answer

Watch out

The count is , not and not ; listing the prime factors with repetition counts neither.

Builds on

Also known as

number of factors, count of divisors, how many divisors, tau(n), d(n), (e+1) product

Appears in past papers

2025 (I)

2024 (II)

2023 (I)

2022 (II)

2022 (I)

2021 (I)