Skip to content
Formula

Sum of divisors from the prime factorisation

Arithmetic • Number System • Factors and Divisors

Formula

If with distinct primes , the sum of all positive divisors of , and included, is , and each bracket equals .

How to use it

  1. 1Factorise into prime powers first.
  2. 2For each prime write the bracket , starting from because the prime may be absent from a divisor, and multiply the brackets.
  3. 3Expanding the product gives every divisor exactly once, which is why the product is the sum.
  4. 4Take off if only proper divisors are wanted, and take off as well if non-trivial divisors are wanted.

Worked example

Find the sum of all positive divisors of .

Step-by-step

  1. 1
  2. 2

    Why: Each divisor takes one power of and one power of , so multiplying out the two brackets lists every divisor once.

  3. 3

Answer

Watch out

Each bracket starts at and runs up to : leaving out the , or stopping at , gives a wrong total. Adding the brackets instead of multiplying them is the other common slip.

Builds on

Also known as

sum of factors, sum of all divisors, sigma(n), divisor sum formula, sum of divisors formula

Appears in past papers

2026 (I)

2023 (I)