CDS Mathematics · Number System

Factors, Divisor Counting & Trailing Zeros

Everything you can read off a number's prime factorisation — how many divisors it has, what they sum to, how many are odd, and how many zeros a factorial or a big product ends in.

All Number System notes CDS Mathematics strategy

Why this matters

Twenty PYQs, four HARD. The whole unit runs on one move: write the number as a product of prime powers, then read the answer off the exponents. Counting the fives in a factorial appears six times across the chapter and is the most reliably tested single technique here.

Concept 1 of 6: Canonical prime-power form

Before you can count anything about a number's divisors you must see it as prime powers. Everything downstream — divisor count, divisor sum, trailing zeros — is a function of the exponents alone, so getting the factorisation right is the whole job.

Definition

Write $N = p_1^{a_1}p_2^{a_2}\cdots p_k^{a_k}$ with distinct primes $p_i$ .

A divisor of $N$ is exactly a product $p_1^{b_1}\cdots p_k^{b_k}$ with $0 \le b_i \le a_i$ .
Evaluate before factorising when the number is given as an expression: compute the value first, then factorise it, because an expression's terms rarely share the factorisation of their difference.
Collect repeated primes: $12^6 = (2^2\cdot3)^6 = 2^{12}3^{6}$ , which then merges with any other power of 3.

Canonical form

N = p_1^{a_1}\,p_2^{a_2}\cdots p_k^{a_k}

Worked example

Write 1800 in canonical prime-power form.

Practice this conceptself-check · 4 quick reps

The same idea in a real exam question:

CDS · 2025 · CDS (I) 2025 — Elementary Mathematics · Q48Moderate

Example 1 · Number System · Factors, Divisor Counting and Trailing Zeros

What is the number of factors of

24^3 - 16^3 - 8^3

Evaluate the expression before you factorise it

For

24^3-16^3-8^3

there is no shortcut identity — compute

13824-4096-512 = 9216

and factorise that as

2^{10}\cdot 3^2

. Students who try to factor term by term and subtract exponents get nonsense, because exponents do not subtract across a difference.

Drill 3 more on canonical prime-power form

Concept 2 of 6: Counting the divisors of a number

Building a divisor means choosing an exponent for each prime, independently. For

p^a

there are

a+1

choices (0 up to

a

), so the total count is the product of all the

(a_i+1)

Definition

If $N = p_1^{a_1}\cdots p_k^{a_k}$ then the number of positive divisors is

d(N) = (a_1+1)(a_2+1)\cdots(a_k+1).

The count includes 1 and $N$ ; subtract 2 when the question excludes them.
$d$ is multiplicative on coprime parts: $d(mn)=d(m)d(n)$ when $\gcd(m,n)=1$ .
$d(N)$ is odd exactly when $N$ is a perfect square, since every exponent is then even.

Divisor count

d(N)=\prod_{i=1}^{k}(a_i+1)

a_ithe exponent of the i-th prime in N

Worked example

How many positive divisors does 720 have?

Practice this conceptself-check · 4 quick reps

The same idea in a real exam question:

CDS · 2018 · CDS (II) 2018 — Elementary Mathematics · Q7Moderate

Example 2 · Number System · Factors, Divisor Counting and Trailing Zeros

The number of divisors of the number 38808, exclusive of the divisors 1 and itself, is

Read whether 1 and N are to be excluded

d(38808)=72

, but the question asks for divisors "exclusive of 1 and itself", so the answer is 70. The same trap runs on 1000:

d=16

, answer 14. The formula always counts both ends — the subtraction is yours to do.

Drill 2 more on counting the divisors of a number

Concept 3 of 6: Summing the divisors of a number

Expanding the product

(1+p+p^2+\cdots)(1+q+q^2+\cdots)

generates every divisor exactly once, so the product of those geometric sums is the sum of the divisors.

Definition

For $N = p_1^{a_1}\cdots p_k^{a_k}$ ,

\sigma(N) = \prod_{i=1}^{k}\left(1+p_i+p_i^{2}+\cdots+p_i^{a_i}\right) = \prod_{i=1}^{k}\frac{p_i^{a_i+1}-1}{p_i-1}.

For a single prime power the sum is a geometric series, so $\sigma(2^n)=2^{n+1}-1$ .
Like $d$ , $\sigma$ is multiplicative on coprime parts.

Divisor sum

\sigma(N)=\prod_{i=1}^{k}\frac{p_i^{a_i+1}-1}{p_i-1}

Worked example

What is the sum of all divisors of 60?

Practice this conceptself-check · 4 quick reps

The same idea in a real exam question:

CDS · 2026 · CDS (I) 2026 — Elementary Mathematics · Q27Easy

Example 3 · Number System · Factors, Divisor Counting and Trailing Zeros

What is the sum of all the divisors of 256 ?

The divisor sum is a product of sums, not a sum of products

For

2^2\cdot 3\cdot 5

the answer is

(1+2+4)(1+3)(1+5)

, not

(1+2+4)+(1+3)+(1+5)

. Multiplying the brackets is what generates each divisor once; adding them counts almost nothing correctly.

Drill 1 more on summing the divisors of a number

Concept 4 of 6: Odd divisors, divisors of a square, and working backwards

Once the exponent formula is in hand, the variants are all small edits to it: drop the prime 2 to count odd divisors, double every exponent to count divisors of

N^2

, and factorise the divisor count to work backwards to the shape of

N

Definition

From $N = 2^{a}m$ with $m$ odd:

Odd divisors: $d(m)$ — ignore the power of 2 entirely.
Even divisors: $d(N) - d(m)$ .
Divisors of $N^{2}$ : every exponent doubles, so $d(N^2)=\prod(2a_i+1)$ , always odd.
Backwards: a given $d(N)$ factorises into the $(a_i+1)$ terms, so $d(N)=15=15$ or $3\times5$ means $N=p^{14}$ or $N=p^{4}q^{2}$ . Size constraints then pick the shape.
Ordered triples with $abc=N$ : distribute each prime power among the three slots independently.

Divisors of a square

d(N^{2})=\prod_{i=1}^{k}(2a_i+1)

Worked example

How many odd divisors does 480 have, and how many even?

Practice this conceptself-check · 4 quick reps

The same idea in a real exam question:

CDS · 2022 · CDS (II) 2022 — Elementary Mathematics · Q21Moderate

Example 4 · Number System · Factors, Divisor Counting and Trailing Zeros

Consider the number

N = 12^6 \times 3^8 \times 5^3

. Which of the following statements is/are correct ? 1. The number of odd factors of N is 60. 2. The number of even factors of N is 720. Select the correct answer using the code given below :

Working backwards from a divisor count usually leaves several shapes

d(N)=15

admits

p^{14}

and

p^{4}q^{2}

. What eliminates the first is the size clue: the smallest

p^{14}

2^{14}=16384

, which has five digits, so a four-digit

N

must be

p^4q^2

. Always list every factorisation of the count, then use the stated size to cut.

Drill 2 more on odd divisors, divisors of a square, and working backwards

Concept 5 of 6: Counting the zeros at the end of a factorial

A trailing zero needs a factor of 10, that is a 2 paired with a 5. In a factorial the twos hugely outnumber the fives, so the number of trailing zeros is just how many fives the factorial contains — and multiples of 25 contribute two fives, not one.

Definition

The number of trailing zeros of $n!$ is

\left\lfloor \frac{n}{5}\right\rfloor + \left\lfloor \frac{n}{25}\right\rfloor + \left\lfloor \frac{n}{125}\right\rfloor + \cdots

Each term counts the numbers up to $n$ carrying at least that many fives, so the powers add up correctly without double counting.
Stop when the divisor exceeds $n$ .
The same sum with 5 replaced by any prime $p$ gives the exponent of $p$ in $n!$ , which is how you handle a divisor like $100^{n}=2^{2n}5^{2n}$ .

Zeros at the end of n factorial

Z(n!)=\sum_{i\ge 1}\left\lfloor \frac{n}{5^{i}}\right\rfloor

Worked example

How many zeros does

50!

end in?

Practice this conceptself-check · 4 quick reps

The same idea in a real exam question:

CDS · 2018 · CDS (I) 2018 — Elementary Mathematics · Q83Moderate

Example 5 · Number System · Factors, Divisor Counting and Trailing Zeros

What is the largest power of 10 that divides the product

1 \times 2 \times 3 \times 4 \ldots \times 23 \times 24 \times 25

Counting only the multiples of 5 undercounts

For

25!

the multiples of 5 number 5, which tempts the answer

10^5

. But 25 itself carries two fives, so the true count is

5+1=6

. Every term

\lfloor n/25\rfloor

\lfloor n/125\rfloor

is a real contribution, not a refinement you can skip.

Drill 3 more on counting the zeros at the end of a factorial

Concept 6 of 6: Trailing zeros of a general product: the scarcer prime wins

Away from factorials the twos are not guaranteed to outnumber the fives, so you must count both and take the smaller. Each factor of 10 needs one of each, so the scarcer prime caps the number of zeros.

Definition

For any product $P$ , the largest $n$ with $10^{n} \mid P$ is

n = \min\big(v_2(P),\; v_5(P)\big),

where

v_p

is the total exponent of

p

P

Expand every composite base first: $75^9 = (3\cdot 5^2)^9 = 3^9 5^{18}$ .
In a weighted product like $1^{50}\times 2^{49}\times\cdots\times 50^{1}$ , each term's exponent multiplies its contribution.
Parity is a shortcut worth trying first: a sum or difference that is odd has no trailing zero at all, whatever its factors look like.

Zeros of a general product

n=\min\big(v_2(P),\,v_5(P)\big)

Worked example

What is the largest

n

such that

10^{n}

divides

2^{8}\times 5^{3}\times 7

Practice this conceptself-check · 4 quick reps

The same idea in a real exam question:

CDS · 2019 · CDS (I) 2019 — Elementary Mathematics · Q86Moderate

Example 6 · Number System · Factors, Divisor Counting and Trailing Zeros

10^n

divides

6^{23} \times 75^9 \times 105^2

, then what is the largest value of

n

Outside a factorial, do not assume the fives are the scarce prime

n!

the twos always outnumber the fives, so counting fives suffices. In

2^{8}\cdot 5^{3}\cdot 7

it is the other way round, and in

6^{23}\cdot75^{9}\cdot105^{2}

the counts are 23 twos against 20 fives — close enough that guessing loses the mark. Count both, every time.

Check the parity of a SUM before counting any factors

For

P+Q

where

P

is a product of odd numbers and

Q

of even ones, the sum is odd, so it ends in no zero at all — and no amount of counting fives inside

P

and

Q

is relevant. The 2026 question is exactly this shape, and the factor-counting route wastes minutes before failing.

Drill 3 more on trailing zeros of a general product: the scarcer prime wins

Summary — formulas & gotchas at a glance

A revision cheat-sheet for the formulas and gotchas above. Click any concept name to jump back to its full explanation.

Formulas (6)

Canonical prime-power form
Canonical form
$N = p_1^{a_1}\,p_2^{a_2}\cdots p_k^{a_k}$
Counting the divisors of a number
Divisor count
$d(N)=\prod_{i=1}^{k}(a_i+1)$
Summing the divisors of a number
Divisor sum
$\sigma(N)=\prod_{i=1}^{k}\frac{p_i^{a_i+1}-1}{p_i-1}$
Odd divisors, divisors of a square, and working backwards
Divisors of a square
$d(N^{2})=\prod_{i=1}^{k}(2a_i+1)$
Counting the zeros at the end of a factorial
Zeros at the end of n factorial
$Z(n!)=\sum_{i\ge 1}\left\lfloor \frac{n}{5^{i}}\right\rfloor$
Trailing zeros of a general product: the scarcer prime wins
Zeros of a general product
$n=\min\big(v_2(P),\,v_5(P)\big)$

Watch out for (7)

Evaluate the expression before you factorise it
→ Canonical prime-power form
Read whether 1 and N are to be excluded
→ Counting the divisors of a number
The divisor sum is a product of sums, not a sum of products
→ Summing the divisors of a number
Working backwards from a divisor count usually leaves several shapes
→ Odd divisors, divisors of a square, and working backwards
Counting only the multiples of 5 undercounts
→ Counting the zeros at the end of a factorial
Outside a factorial, do not assume the fives are the scarce prime
→ Trailing zeros of a general product: the scarcer prime wins
Check the parity of a SUM before counting any factors
→ Trailing zeros of a general product: the scarcer prime wins

Test yourself on Number System

20 past CDS questions from this chapter, timed at 24 minutes and marked the way the exam marks it. You see your score and every answer the moment you finish. Free to start.

Take the Number System chapter test Drill all 20 questions