def d(n): #return sum(x for x in range(1, n//2 + 1) if not (n % x)) return sum(properdivisors(n))
def isabundant(n): return sum(properdivisors(n)) > n