What is the square root of the sum of all the positive divisors integers of 32400?
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.
Easiest way is prime factorization. Here are the tricks which I followed -
3 2 4 0 0 = 3 2 4 ⋅ 1 0 2 = 4 ⋅ 8 1 ⋅ 1 0 2 = 2 2 ⋅ 3 4 ⋅ 2 2 ⋅ 5 2 = 2 4 ⋅ 3 4 ⋅ 5 2
Using sum of divisors formula, the sum is -
( 2 4 + 2 3 + 2 2 + 2 + 1 ) ( 3 4 + 3 3 + 3 2 + 3 + 1 ) ( 5 2 + 5 + 1 ) = 3 1 ⋅ 1 2 1 ⋅ 3 1 = 1 1 2 ⋅ 3 1 2
Square root -
1 1 2 ⋅ 3 1 2 = 1 1 ⋅ 3 1 = 3 4 1
Simple standard approach.
Problem Loading...
Note Loading...
Set Loading...
Step 1: Prime factorize 3 2 4 0 0 .
3 2 4 0 0 = 2 4 × 3 4 × 5 2
Step 2: Since the sum of the sum of a number n = p 1 a 1 × p 2 a 2 × … p n a n is p 1 − 1 p 1 a 1 + 1 − 1 × p 2 − 1 p 2 a 2 + 1 − 1 × … p n − 1 p n a n + 1 − 1 , where p 1 , p 2 … p n are distinct prime factors of n and a 1 , a 2 … a n are highest powers of p 1 , p 2 … p n in n respectively.
So, using this formula we get sum of the divisors of 3 2 4 0 0 as
2 − 1 2 4 + 1 − 1 × 3 − 1 3 4 + 1 − 1 × … 5 − 1 5 2 + 1 − 1 = 3 1 × 1 2 1 × 3 1
So, taking it's square root we get, the answer as 3 4 1 .