Skip to content
Formula

Counting the divisors of a number from its prime factors

Quantitative Aptitude • Number System

Formula

Write as a product of primes, for example . Every divisor of is made of the same primes, with no more of each than has: it takes 2 some number of times from 0 to (that is choices), and 3 from 0 to times ( choices). Each pair of choices gives a different divisor, so has divisors. With more primes, multiply one more bracket for each.

How to use it

  1. 1First split the number into primes and write each prime with its power.
  2. 2Add 1 to every power and multiply the results.
  3. 3Remember that 1 and the number itself are counted: they are the 'take none' and 'take all' choices.

Worked example

How many whole numbers divide 72 exactly?

Step-by-step

  1. 1
    .
  2. 2
    A divisor takes 2 zero to three times (4 choices) and 3 zero to two times (3 choices).

    Why: Each divisor is fixed by how many 2s and how many 3s it has.

  3. 3
    .

Answer

12 divisors.

Watch out

Multiplying the powers themselves, , instead of the powers plus one is the usual slip; it forgets the choice of taking a prime zero times.

Also known as

number of factors, number of divisors, how many divisors, factor count formula

Appears in past papers

2023