A humble number is a number that consists of prime factors which are less than 10.
How many humble numbers can divide ?
Try this too .
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.
A humble number is a number whose prime factors are only 2 , 3 , 5 ,and 7 .
Thus, in 1 0 0 ! , we get the number of factors of the largest humble number that can divide it. That is, if N is the largest humble number that can divide 1 0 0 ! , then
N = 2 9 7 × 3 4 8 × 5 2 4 × 7 1 6
Each of these exponents were obtained by
∑ n = 1 ∞ ⌊ k n 1 0 0 ⌋
with k = 2 , 3 , 5 , and 7 .
Now, the number of factors of N equals
( 9 7 + 1 ) × ( 4 8 + 1 ) × ( 2 4 + 1 ) × ( 1 6 + 1 ) = the answer, 2 0 4 0 8 5 0 .