The total number of proper positive divisors of 115500 is
Note: The term "proper divisors" excludes the number 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.
Where do you get the 3 × 2 × 4 × 2 × 2 = 9 6 ? :o
Log in to reply
Precious: Notice that the factor 2 can be included 0, 1 or 2 times, which is 3 possibilities. Likewise, the factor 3 can be included 0 or 1 times, which is 2 possibilities. 5 can be included from 0 to 3 times, which is 4 possibilities. And so on.
R e s p o n s e to A s t r o E n t h u s i a s t : Actually there is a formula that for every positive composite number N and its distinct prime factors a , b , c , d . . . . . . . . . with p , q , r , s . . . . . . . . . . . . . being the indices of a , b , c , d . . . . . . . . .
N = a p × b q × c r × d s × . . . . . . . . . . . .
Then total factors of N = ( p + 1 ) ( q + 1 ) ( r + 1 ) ( s + 1 ) . . . . . . . . . . . . . . . . . . .
Proper divisors only excludes the number itself, but include 1. So the answer should be 96-1=95.
I've updated the answer to 95.
number of factors and number Proper divisors are equal, isn't??
The correct answer is 94
Yes the answer should be 96
Problem Loading...
Note Loading...
Set Loading...
The number given is
1 1 5 5 0 0 = 1 0 0 × 1 1 × 1 0 5 = 2 2 . 3 . 5 3 . 7 . 1 1
Thus the number of factors is 3 × 2 × 4 × 2 × 2 = 9 6 and this includes the number itself. But in PROPER divisors, we have to exclude the number itself, hence the answer is 9 5