Избыточные числа
Numbers whose proper divisors add up to more than themselves: an overflow of mathematical richness
An abundant number (also called an excessive number) is a positive integer where the sum of its proper divisors exceeds the number itself. The smallest abundant number is 12, whose divisors 1 + 2 + 3 + 4 + 6 = 16 surpass 12 by 4. Abundant numbers play an important role in number theory and connect to concepts like perfect numbers, amicable numbers, and the Goldbach conjecture.
Классификация чисел по делителям
Every positive integer falls into one of three categories based on how the sum of its proper divisors compares to the number itself:
Sum of proper divisors is less than the number. Most integers are deficient.
Divisores: 1 + 2 + 4 = 7 < 8
Sum of proper divisors equals exactly the number. Extremely rare (6, 28, 496...).
Divisores: 1 + 2 + 3 = 6
Sum of proper divisors exceeds the number. About 25% of positive integers are abundant.
Divisores: 1 + 2 + 3 + 4 + 6 = 16 > 12
Свойства избыточных чисел
Abundant numbers have several remarkable mathematical properties that connect them to other areas of number theory:
Измерение избыточности
The abundance of a number is the difference between the sum of its proper divisors and the number itself. The higher the abundance, the more "excessive" the number is. Here are examples with their abundance values:
| Number | Proper Divisors | Sum | Abundance |
|---|---|---|---|
| 12 | 1, 2, 3, 4, 6 | 16 | +4 |
| 18 | 1, 2, 3, 6, 9 | 21 | +3 |
| 20 | 1, 2, 4, 5, 10 | 22 | +2 |
| 24 | 1, 2, 3, 4, 6, 8, 12 | 36 | +12 |
| 30 | 1, 2, 3, 5, 6, 10, 15 | 42 | +12 |
| 36 | 1, 2, 3, 4, 6, 9, 12, 18 | 55 | +19 |
| 40 | 1, 2, 4, 5, 8, 10, 20 | 50 | +10 |
| 48 | 1, 2, 3, 4, 6, 8, 12, 16, 24 | 76 | +28 |
| 60 | 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30 | 108 | +48 |
| 70 | 1, 2, 5, 7, 10, 14, 35 | 74 | +4 |
Сверхизбыточные числа
A superabundant number is a number whose ratio of divisor sum to the number itself is higher than for any smaller positive integer. These are the "champions" of abundance.
The first superabundant numbers are:
Superabundant numbers were studied by Leonidas Alaoglu and Paul Erdos in 1944. They are related to highly composite numbers and play a role in the study of the Riemann hypothesis.
The First 80 Abundant Numbers
Click on any abundant number to see its full analysis with divisors, factorization, and more.
Вы знали
- All abundant numbers discovered so far are even, yet it remains unproven whether odd abundant numbers exist. If one exists, it must exceed 10^1500 and satisfy extraordinarily restrictive conditions. The possibility (however remote) that odd abundant numbers exist at arbitrarily large size prevents definitive resolution. This unresolved question has persisted millennia despite extensive investigation.
- The first pair of consecutive abundant numbers is 5186 and 5187 (verified 1975). The spacing between abundant numbers shows no simple pattern—sometimes adjacent abundants occur relatively close together, other times gaps extend to thousands. Finding longest abundant number gaps constitutes active research. The irregular spacing demonstrates seemingly random distribution despite deterministic properties.
- Superabundant numbers maximize σ(n)/n ratio—divisor sum exceeds n by maximum percentage. Primitive superabundant numbers generate all others multiplicatively. The sequence of superabundant numbers: 1, 2, 4, 6, 12, 24, 36, 48, 60, 120, 180, 240, 360, 720, 840, 1260, 1680... Each represents optimal n of its magnitude for high divisor abundance. Discovering new superabundant numbers advances understanding of divisor function growth.
- Highly composite numbers maximize the divisor count τ(n) (number of divisors). Many highly composite numbers are abundant, but not all abundant numbers are highly composite. The relationship between divisor count and divisor sum (abundant property) reveals complex structure. Understanding this distinction requires sophisticated divisor theory.
- The sum of an abundant number and any other positive integer might be abundant, deficient, or perfect depending on specific values. The additive combination of abundant numbers generates unpredictable results—abundant + abundant might be abundant or deficient. This lack of closure under addition contrasts with multiplicative properties, demonstrating why abundant number arithmetic lacks simple rules.
Preguntas Frecuentes
How do you determine if a number is abundant?
Calculate all proper divisors (divisors excluding the number itself), sum them, and compare the sum to the original number. If sum exceeds the number, it's abundant. For example, 20: divisors are 1,2,4,5,10; sum is 22 > 20, so 20 is abundant. Algorithmically, iterate through all integers from 1 to n/2 (inclusive), checking divisibility; if divisible, add to sum. Once sum exceeds n, the number is abundant (early termination possible). Efficient computation uses divisor formula from prime factorization: if n = p₁^a₁ × p₂^a₂ × ... × p_k^a_k, then σ(n) = ∏(p_i^(a_i+1) - 1)/(p_i - 1). Computing σ(n) then comparing with 2n determines abundance efficiently. For large numbers, factorization-based methods outperform divisor enumeration. Most programming implementations use factorization-based approaches for efficiency.
Are all even numbers abundant?
No, even numbers classify into perfect, abundant, and deficient categories. Examples: 2 is deficient (divisors: 1; sum: 1<2); 4 is deficient (divisors: 1,2; sum: 3<4); 6 is perfect (divisors: 1,2,3; sum: 6); 8 is deficient (divisors: 1,2,4; sum: 7<8); 12 is abundant (divisors: 1,2,3,4,6; sum: 16>12). Approximately 75% of even numbers are deficient, 25% abundant, and infinitely many perfect (all following Euclid's formula). The abundance property depends heavily on specific prime factorization—numbers with many small prime factors tend toward abundance, while prime powers tend deficient. Even numbers with small prime factors (like multiples of 2, 3, 5) frequently become abundant. The distribution among even numbers reflects divisor structure complexity.
Why are all known избыточные числа even?
The reason remains unproven, though substantial theoretical progress explains why odd избыточные числа (if they exist) would be extraordinarily rare and large. If an odd abundant number exists, analysis shows it must exceed 10^1500 and satisfy restrictive factorization constraints. No odd abundant number has been discovered despite computational searches to enormous magnitudes. The rarity likely reflects deep number-theoretic structure making odd abundants (if they exist) extraordinarily uncommon compared to even abundants. Even numbers, having factor 2, gain additional divisors more easily—an even number has approximately twice the divisors of an odd number of similar magnitude (rough heuristic). This enables easier abundant status achievement. Odd abundants would require remarkably specific prime factorizations to accumulate sufficient divisors. Whether odd избыточные числа actually exist or remain forever undiscovered remains one of number theory's open questions. This unresolved mystery has engaged mathematicians for centuries.