#include <iostream>
#include <cmath>
// abundant odd number = sum of proper divisors > number
unsigned SumOddNumberProperDivisors(const unsigned num) {
unsigned sum = 1;
for (unsigned i = 3, j; i < sqrt(num) + 1; i += 2)
if (num % i == 0)
sum += i + (i == (j = num / i) ? 0 : j);
return sum;
}
int main()
{
unsigned num = 1;
for (unsigned i = 0; i < 1000; num += 2) {
if (SumOddNumberProperDivisors(num) > num) {
i++;
}
}
std::cout << num;
}
/*
run:
492977
*/