Find the number of distinct positive divisors of 21600 (inclusive of 1 and itself).
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.
Please check your working again.
Do you mean "The number of divisors of N is (p+1)(y+1)(r+1)"?
How are you able to factor the number so quickly?
Why must the answer be "(p+1)(y+1)(r+1)"?
Here's how I did it:
2 1 6 0 0 = 2 1 6 × 1 0 0 = 6 3 × 1 0 2 = ( 2 × 3 ) 3 × ( 2 × 5 ) 2 .
Equivalently, 2 1 6 0 0 = 2 3 + 2 × 3 3 × 5 2 = 2 5 × 3 3 × 5 2 .
The number of factors (inclusive of 1 and itself) of the N = p 1 r 1 × p 2 r 2 × p 3 r 3 is simply equals to ( r 1 + 1 ) ( r 2 + 1 ) ( r 3 + 1 ) .
In this case p 1 = 2 , p 2 = 3 , p 3 = 5 , r 1 = 5 , r 2 = 3 , r 3 = 2 .
Hence the answer is ( 5 + 1 ) ( 3 + 1 ) ( 2 + 1 ) = 7 2 factors.
Problem Loading...
Note Loading...
Set Loading...
To find the total no of divisors of N.
write the prime factors on N
if N = a^p .b^y. c^r and so on then total no of divisors of
N = (a+1)(b+1)(c+1)
21600 = 2^5 X 3^3 X 5^2 (^ denotes power)
so total no of divisors = (5+1)(3+1)(2+1) = 6 X 4 X 3 = 72