MathCastle
ChallengeMediumHard Number Theory

Hard Number Theory · Medium problem

Find the smallest odd positive integer that is abundant (that is, the sum of its proper divisors exceeds the number itself).