What is the sum of all positive divisors of the number 12600?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
To generalize the problem, consider a positive integer n
n = p 1 e 1 ⋅ p 2 e 2 ⋅ … ⋅ p n e n
Where the p i c i ∈ { 1 , 2 , … , n } are n 's prime factors
Now consider the following product
P = ( 1 + p 1 + p 1 2 + … + p 1 e 1 ) ( 1 + p 2 + p 2 2 + … + p 2 e 2 ) … ( 1 + p n + p n 2 + … + p n e n )
Claim:
When we expand P we get the sum of all the divisors of n
Proof:
All the numbers we get when we expand P are different and they are all of the form
p 1 a 1 ⋅ p 2 a 2 ⋅ … ⋅ p n a n
Where 0 ≤ a i ≤ e 1 i ∀ i ∈ { 1 , 2 , … , n }
Since when we expand we get ( e 1 + 1 ) ( e 2 + 1 ) … ( e n + 1 ) terms, they must indeed be all the divisors of n □
In a compact form
P = i = 1 ∏ n j = 0 ∑ e i p i j = i = 1 ∏ n p i − 1 p i e i + 1 − 1
In this case n = 1 2 6 0 0 = 2 3 ⋅ 3 2 ⋅ 5 2 ⋅ 7 , so
P = 2 − 1 2 4 − 1 ⋅ 3 − 1 3 3 − 1 ⋅ 5 − 1 5 3 − 1 ⋅ 7 − 1 7 2 − 1 = 1 5 ⋅ 1 3 ⋅ 3 1 ⋅ 8 = 4 8 3 6 0