Problem 60851. Find the closest e-abundant numbers

An abundant number is an integer n whose sum of its positive proper divisors—or the sum of its divisors excluding itself—exceeds n. For example, 12 is abundant because 1+2+3+4+6 = 16.
An e-abundant number is an integer n whose sum of its positive proper e-divisors exceeds n. For example, 1764 is e-abundant because its sum of proper e-divisors is 2268.
Write a function that returns the closest e-abundant numbers below and above the input. If the input is e-abundant, return only that number. If no e-abundant numbers are smaller than the input, then return NaN.
Solve

Solution Stats

100.0% Correct | 0.0% Incorrect
Last Solution submitted on Apr 21, 2025

Solution Comments

Show comments

Problem Recent Solvers4

Suggested Problems

More from this Author307

Problem Tags

number theory sequence

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!