Let denote the smallest positive integer which has exactly divisors (inclusive of and itself). What is the sum of digits of ?
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.
Notice that 2 0 0 = 2 3 ∗ 5 2 . Thus we can say that the N will be in the form a 1 x 1 ∗ a 2 x 2 ∗ a 3 x 3 ∗ … such that a k is prime and ( x 1 + 1 ) ∗ ( x 2 + 1 ) ∗ ( x 3 + 1 ) ∗ ⋯ = 2 0 0 (so that N has 2 0 0 factors by the product law). We need to minimise N , and this occurs when N = 2 4 ∗ 3 4 ∗ 5 ∗ 7 ∗ 1 1 = 4 9 8 9 6 0 since ( 4 + 1 ) ∗ ( 4 + 1 ) ∗ ( 1 + 1 ) ∗ ( 1 + 1 ) ∗ ( 1 + 1 ) = 2 0 0 . Hence, the digit sum of N is 4 + 9 + 8 + 9 + 6 + 0 = 3 6