What is the smallest odd squarefree abundant number ?
Definition :
An abundant number is a number for which the sum of its proper divisors is greater than the number itself. For example, the proper divisors of 12 are 1, 2, 3, 4, 6, and the sum of these proper divisor exceed the number 12, thus 12 is an abundant number.
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.
Charming problem!
σ ( 3 × 5 × 7 × 1 1 × 1 3 ) = 3 2 2 5 6 > 2 × 1 5 0 1 5 . But if n = p 1 × . . . × p m for four or fewer distinct odd prime factors, then n σ ( n ) = ( 1 + p 1 1 ) × . . . × ( 1 + p m 1 ) ≤ ( 1 + 3 1 ) ( 1 + 5 1 ) ( 1 + 7 1 ) ( 1 + 1 1 1 ) < 2 .