Exactly two of the divisors of an integer are prime numbers. Given that has 77 divisors inclusive of 1 and itself, determine the number of divisors 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.
Let the two prime divisors of N be p and q and N = p m q n , where m and n are positive integers. Then N 2 = p 2 m q 2 n and it is given that N 2 has 7 7 divisors. That means its number of divisors is given by ( 2 m + 1 ) ( 2 n + 1 ) = 7 7 , ⇒ m = 3 and n = 5 or reverse. Therefore, the number of divisors of N is ( m + 1 ) ( n + 1 ) = 4 × 6 = 2 4 .