Sum of Divisors of a Prime Power
Also known as sigma function · σ(p^k) · sum of factors · aliquot sum prime power
Worked example: σ(2¹⁰) = 2047. Press Try an example to run it live, then adjust anything.
Enter your known values, leave one input blank, and solves for the missing one. Tap a variable’s symbol to see what it means, with a typical value.
Where Sum of Divisors of a Prime Power fits
See also
Divisor Count from Prime Exponents: Both use prime exponent.Sum of Divisors of a Prime Power explained
Add up every divisor of , that is , and you get 2047. The formula gets there without the addition because the divisors of a prime power are a geometric series: each is the previous one times p. The closed form for such a series is , which for base 2 collapses to the pleasant . Those are the Mersenne numbers, and when one of them is prime it generates an even perfect number, which is how this formula ended up at the centre of a 2,000-year-old open problem.
The σ function matters beyond curiosities because it is multiplicative: for numbers with no common factor, . So the prime-power case is not a special case, it is the whole thing. To get σ(360) you compute σ(2³) = 15, σ(3²) = 13 and σ(5) = 6, then multiply: 1170. Every prime-power piece comes from this formula.
Two cautions. First, σ counts the number itself among its divisors: σ(6) = 12, not 6. The "aliquot sum" used in the definition of perfect and amicable numbers is σ(n) − n, so subtract before comparing. Second, p really must be prime. Feed this 6³ and it returns , whereas the divisors of 216 actually sum to 600. Nothing in the arithmetic complains; the answer is simply about a series, not about a divisor set.
Sum of Divisors of a Prime Power formula
- = Prime base
- = Exponent
- = Sum of divisors
Cite this page
formula.expert. (2026, November 1). Sum of Divisors of a Prime Power Formula & Calculator. https://formula.expert/solvers/sum-of-divisors-prime-power