A superabundant number is a type of natural number . They were defined by Leonidas Alaoglu and Paul Erdős in 1944.
Any natural number n is called superabundant when a certain equation is true.
σ
(
m
)
m
<
σ
(
n
)
n
{\displaystyle {\frac {\sigma (m)}{m))<{\frac {\sigma (n)}{n))}
In this equation, m is every integer less than n . σ is the sum of every positive divisor of that number.
An example would be to use the number 9 . For every number less than 8, the sigma is 1, 3, 4, 7, 6, 10, 8 and 16. (σ (m ))/m is 16/9. (σ (n))/n is equal to 13/9. 13/9 is less than 16/9. This makes 9 not a superabundant number
The first few superabundant numbers are 1 , 2 , 4 , 6 , 12 , 24 , 36 , 48 , 60 , 120 , ... (sequence A004394 in the OEIS ).
Leonidas Alaoglu and Paul Erdős proved that if n is superabundant, then there is a k and a 1 , a 2 , ..., a k such that
n
=
∏
i
=
1
k
(
p
i
)
a
i
{\displaystyle n=\prod _{i=1}^{k}(p_{i})^{a_{i))}
where p i is the i -th prime number , and
a
1
≥
a
2
≥
⋯
≥
a
k
≥
1.
{\displaystyle a_{1}\geq a_{2}\geq \dotsb \geq a_{k}\geq 1.}
Basically, they proved that if a number is superabundant, the exponent of a larger prime number is never bigger than a smaller prime number during prime decomposition(the process of a composite number become smaller prime numbers ). All primes from 0 to
p
k
{\displaystyle p_{k))
are also factors of n . The equation says that a superabundant number has to be an even integer . It also is a multiple of the k -th primorial
p
k
#
.
{\displaystyle p_{k}\#.}
Superabundant numbers are like highly composite numbers. Not all superabundant numbers are highly composite numbers, though.
Alaoglu and Erdős observed that all superabundant numbers are also highly abundant.
Briggs, Keith (2006), "Abundant numbers and the Riemann hypothesis" , Experimental Mathematics , 15 (2): 251–256, doi :10.1080/10586458.2006.10128957 , S2CID 46047029 .
Akbary, Amir; Friggstad, Zachary (2009), "Superabundant numbers and the Riemann hypothesis", American Mathematical Monthly , 116 (3): 273–275, doi :10.4169/193009709X470128 .
Alaoglu, Leonidas; Erdős, Paul (1944), "On highly composite and similar numbers", Transactions of the American Mathematical Society , 56 (3), American Mathematical Society: 448–469, doi :10.2307/1990319 , JSTOR 1990319 .
Other polynomial numbers
Hilbert
Idoneal
Leyland
Loeschian
Lucky numbers of Euler
Fibonacci
Jacobsthal
Leonardo
Lucas
Padovan
Pell
Perrin
Possessing a specific set of other numbers
Congruent
Knödel
Riesel
Sierpiński
Expressible via specific sums
Nonhypotenuse
Polite
Practical
Primary pseudoperfect
Ulam
Wolstenholme
Figurate numbers
2-dimensional
centered
Centered triangular
Centered square
Centered pentagonal
Centered hexagonal
Centered heptagonal
Centered octagonal
Centered nonagonal
Centered decagonal
Star
non-centered
Triangular
Square
Square triangular
Pentagonal
Hexagonal
Heptagonal
Octagonal
Nonagonal
Decagonal
Dodecagonal
3-dimensional
centered
Centered tetrahedral
Centered cube
Centered octahedral
Centered dodecahedral
Centered icosahedral
non-centered
Tetrahedral
Cubic
Octahedral
Dodecahedral
Icosahedral
Stella octangula
pyramidal
4-dimensional
non-centered
Pentatope
Squared triangular
Tesseractic
Combinatorial numbers
Bell
Cake
Catalan
Dedekind
Delannoy
Euler
Eulerian
Fuss–Catalan
Lah
Lazy caterer's sequence
Lobb
Motzkin
Narayana
Ordered Bell
Schröder
Schröder–Hipparchus
Stirling first
Stirling second
Wieferich
Wall–Sun–Sun
Wolstenholme prime
Wilson
Pseudoprimes
Carmichael number
Catalan pseudoprime
Elliptic pseudoprime
Euler pseudoprime
Euler–Jacobi pseudoprime
Fermat pseudoprime
Frobenius pseudoprime
Lucas pseudoprime
Lucas–Carmichael number
Somer–Lucas pseudoprime
Strong pseudoprime
Arithmetic functions and dynamics
Divisor functions Prime omega functions Euler's totient function
Highly cototient
Highly totient
Noncototient
Nontotient
Perfect totient
Sparsely totient
Aliquot sequences
Amicable
Perfect
Sociable
Untouchable
Primorial
Blum
Cyclic
Erdős–Nicolas
Erdős–Woods
Friendly
Giuga
Harmonic divisor
Lucas–Carmichael
Pronic
Regular
Rough
Smooth
Sphenic
Størmer
Super-Poulet
Zeisel
Arithmetic functions and dynamics Digit sum
Digit sum
Digital root
Self
Sum-product
Digit product
Multiplicative digital root
Sum-product
Coding-related Other
Dudeney
Factorion
Kaprekar
Kaprekar's constant
Keith
Lychrel
Narcissistic
Perfect digit-to-digit invariant
Perfect digital invariant
P-adic numbers -relatedDigit -composition related
Palindromic
Pandigital
Repdigit
Repunit
Self-descriptive
Smarandache–Wellin
Strictly non-palindromic
Undulating
Digit-permutation related
Cyclic
Digit-reassembly
Parasitic
Primeval
Transposable
Divisor-related
Equidigital
Extravagant
Frugal
Harshad
Polydivisible
Smith
Vampire
Other
Pancake number
Sorting number
Divisibility-based sets of integers
Overview Factorization forms Constrained divisor sums
Perfect
Almost perfect
Quasiperfect
Multiply perfect
Hemiperfect
Hyperperfect
Superperfect
Unitary perfect
Semiperfect
Practical
Erdős–Nicolas
With many divisors Aliquot sequence-related
Untouchable
Amicable (Triple)
Sociable
Betrothed
Base -dependent
Equidigital
Extravagant
Frugal
Harshad
Polydivisible
Smith
Other sets
Arithmetic
Deficient
Friendly
Solitary
Sublime
Harmonic divisor
Descartes
Refactorable
Superperfect