ProjectEulerUtil is_abundant checks if a number is abundant get_problem_title(n) get the title of the nth question inverse_digits(digits(n)) gives n proper_divisors(n) gives the proper divisors of n