Check if a Number is Abundant

Given a positive integer n, return true when the sum of its positive proper divisors is greater than n. Otherwise, return false. A proper divisor divides n…

Given a positive integer `n`, return `true` when the sum of its positive proper divisors is greater than `n`. Otherwise, return `false`. A proper divisor divides `n` exactly and is smaller than `n`. For example, the proper divisors of `12` are `1`, `2`, `3`, `4`, and `6`; their sum is `16`, so `12` is abundant.

- `1 ≤ n ≤ 10^6` - `n` is always a positive integer.

Example 1: input n = 12; output true. The proper divisors sum to 16, which is greater than 12.

Example 2: input n = 28; output false. The proper divisors sum to exactly 28, not more than 28.

Example 3: input n = 13; output false. The only positive proper divisor is 1.

Category: Math. Topic: math. Difficulty: Easy. Patterns: math.