Number System
🔒 Log in to trackFactors, prime factorisation & trailing zeros
🔒 Log in to trackWrite N as a product of primes, N = p to the a times q to the b times r to the c. The number of factors is (a+1)(b+1)(c+1), the sum of factors comes from bracket products, and trailing zeros of a factorial come from counting fives.
Overview
A factor of a number divides it exactly. The factors of are . A multiple is the reverse idea: Every question here starts from the prime factorisation, so that skill comes first.
Prime factorisation
Keep dividing by the smallest prime that fits. . Write the result in power form ; every method below reads the exponents.
Counting factors
A factor of chooses one power of each prime. The power of : or , so five choices. The power of : or , so three choices. The power of : or , so two choices.
Rule: Number of factors . For : factors.
Odd, even and special factors
- Odd factors: drop the power of completely. For : odd factors .
- Even factors: total minus odd, here .
- Factors that are multiples of : divide by and count factors of the result. For with : , giving .
- Perfect-square factors: every exponent may take even values only. Cube factors:
Sum of factors
Write one bracket per prime and multiply.
For : . For the sum of even factors only, start the bracket of at :
Tip: The bracket form also answers sum of odd factors: just delete the bracket of .
Product of factors and factor pairs
Factors pair as and each pair multiplies to . So the product of all factors of is where is the factor count: for , with factors, the product is .
The same pairing counts the ways to write as a product of two factors: ways when is not a perfect square, when it is. For two co-prime factors the answer is , with the number of distinct primes.
Trailing zeros of factorials
A trailing zero needs a . Factorials hold more twos than fives, so count the fives: divide by , then the quotient by again, and add.
Rule: Zeros in . For : zeros.
Highest power of a prime in a factorial
Same successive division by the prime. The power of in is . For a composite such as , find each prime's power, divide the power of by , and take the smaller result. In : twos give , so twos-pairs, and threes give ; the answer is .
Question types you will see
Each type: how to recognise it, the method step by step, and one question to try.
Number of factors: total, odd, even
The question asks how many factors or divisors a number has, or how many of them are odd or even.
Prime-factorise .
Total factors: multiply (each exponent ).
Odd factors: ignore the power of entirely.
Even factors: total minus odd.
Each factor picks one power of every prime, and the choices are independent.
How many factors does 420 have?
Show solutionHide solution
.
Total: .
factors.
24
Special factors: squares, cubes, multiples of k
The question asks how many factors of N are perfect squares, perfect cubes, or divisible by a given number.
For square factors, allow only even exponents for every prime.
For cube factors, allow only
For multiples of , divide by and count factors of the quotient.
A square factor carries even powers only; a factor divisible by k is k times a factor of N/k.
How many factors of 2 to the power 6 x 3 to the power 4 are perfect squares?
Show solutionHide solution
Powers of available to a square: , that is choices.
Powers of : , that is choices.
square factors.
12
Sum of factors
The question asks for the sum of all factors of N, or the sum of only the odd or only the even factors.
Prime-factorise .
Write one bracket per prime, running from to the full power.
Multiply the brackets.
Odd sum: delete the bracket of . Even sum: start that bracket at .
Expanding the bracket product produces every factor exactly once.
Find the sum of all factors of 90.
Show solutionHide solution
.
Brackets: .
.
234
Trailing zeros in a factorial or product
The question asks how many zeros end a factorial like 90!, or end a written-out product.
Divide by and keep the whole part.
Divide that quotient by again, and keep going.
Add all the quotients.
For a plain product, count the twos and the fives and take the smaller count.
Each trailing zero needs one two and one five, and fives are the scarce partner.
How many zeros are at the end of 90 factorial?
Show solutionHide solution
.
.
Zeros: .
21
Highest power of a prime or composite in a factorial
The question asks for the largest n such that 7 to the n divides 150!, or the highest power of 12 in 50!.
For a prime : divide by , then the quotient again, and add the quotients.
For a composite, split into prime powers.
Divide each prime's count by the power required.
Take the smallest result.
Floor division counts multiples of p, then the extra p carried by multiples of its square, and so on.
Find the highest power of 7 that divides 150 factorial.
Show solutionHide solution
.
.
Total: .
7 to the power 24
Product of factors and factor pairs
The question asks for the product of all factors of N, or in how many ways N can be written as a product of two factors.
Count the factors .
Product of factors: raise to .
Two-factor products: ways, or for a perfect square.
Co-prime pairs: with distinct primes.
Factors pair as f with N over f, and each pair multiplies to N.
In how many ways can 48 be written as a product of two factors?
Show solutionHide solution
, so factors.
is not a perfect square.
Ways: .
5
Formula sheet
when 2 has exponent a
Shortcuts that save time
If N has two to the power a in it, even factors equal a times the factor count of the odd part.
How many even factors does 360 have?
Show solutionHide solution
.
Even factors .
.
18
For trailing zeros, keep dividing n by 5 and add the quotients until the quotient is 0.
How many zeros end 1000!?
Show solutionHide solution
.
Sum: .
zeros.
249
One bracket per prime, each running from 1 up to the full power. Multiply the brackets.
Find the sum of all factors of 72.
Show solutionHide solution
.
Brackets: .
.
195
Mistakes to avoid
Where most students lose marks on this subtopic.
Counting only n/5 for trailing zeros.
Add the extra fives from 25, 125 and higher powers of 5 as well.
Adding exponents instead of multiplying (a+1)(b+1)(c+1).
The choices per prime multiply, they never add.
Forgetting 1 and N as factors.
Both count; the formula (a+1)(b+1)(c+1) already includes them.
Adding the zero counts for a sum like 100! + 200!.
The sum keeps only the smaller count of trailing zeros.
Testing for a prime with squares of primes only.
Divide by every prime up to the square root of N.
Quick revision
Read this the night before the exam.
Factor count: ; odd factors: drop the .
Multiples of among the factors: count factors of .
Square factors: even exponents only; cube factors:
Sum: one bracket per prime, multiply the brackets.
Product of all factors: .
Zeros in : keep dividing by and add quotients.
Composite power in : split into prime powers and take the smallest.
Practice: 17 questions
Sets of 10, mixed across the question types above. Every answer has a step-by-step explanation.
Topic test · 10 questions
Suggested time 8 min · wrong answers go to your mistake notebook automatically.