abundant.py

Created by matt-numworks

Created on May 23, 2024

137 Bytes

Determines if a number is abundant or not. This means that the sum of the divisors are greater than the actual number. For example, 12 has divisors of 2, 3, 4, and 6. This sum is 15 and greater than 12.


def is_abundant(n):
    factor_sum = sum([factor for factor in range(1, n) if n % factor == 0])
    return factor_sum > n

During your visit to our site, NumWorks needs to install "cookies" or use other technologies to collect data about you in order to:

With the exception of Cookies essential to the operation of the site, NumWorks leaves you the choice: you can accept Cookies for audience measurement by clicking on the "Accept and continue" button, or refuse these Cookies by clicking on the "Continue without accepting" button or by continuing your browsing. You can update your choice at any time by clicking on the link "Manage my cookies" at the bottom of the page. For more information, please consult our cookies policy.