What is the smallest superdeficient number of the form n = p^2*q where p & q are different primes?

129 Views Asked by At

superdeficient means the sum of n's proper factors that are less than n, when multiplied by 2 are less than n. E.g 35 is superdeficient since 1+5+7=13*2=26<35?

1

There are 1 best solutions below

9
On BEST ANSWER

Sufficient and necessary condition is $$(1+\frac{1}{p}+\frac{1}{p^2})(1+\frac{1}{q})<\frac{3}{2},$$ so the minimal such number is $5^2*7$.