Primitive abundant number

Last updated
Euler diagram of abundant, primitive abundant, highly abundant, superabundant, colossally abundant, highly composite, superior highly composite, weird and perfect numbers under 100 in relation to deficient and composite numbers Euler diagram numbers with many divisors.svg
Euler diagram of abundant, primitive abundant, highly abundant, superabundant, colossally abundant, highly composite, superior highly composite, weird and perfect numbers under 100 in relation to deficient and composite numbers

In mathematics a primitive abundant number is an abundant number whose proper divisors are all deficient numbers. [1] [2]

For example, 20 is a primitive abundant number because:

  1. The sum of its proper divisors is 1 + 2 + 4 + 5 + 10 = 22, so 20 is an abundant number.
  2. The sums of the proper divisors of 1, 2, 4, 5 and 10 are 0, 1, 3, 1 and 8 respectively, so each of these numbers is a deficient number.

The first few primitive abundant numbers are:

20, 70, 88, 104, 272, 304, 368, 464, 550, 572 ... (sequence A071395 in the OEIS )

The smallest odd primitive abundant number is 945.

A variant definition is abundant numbers having no abundant proper divisor (sequence A091191 in the OEIS ). It starts:

12, 18, 20, 30, 42, 56, 66, 70, 78, 88, 102, 104, 114


Properties

Every multiple of a primitive abundant number is an abundant number.

Every abundant number is a multiple of a primitive abundant number or a multiple of a perfect number.

Every primitive abundant number is either a primitive semiperfect number or a weird number.

There are an infinite number of primitive abundant numbers.

The number of primitive abundant numbers less than or equal to n is [3]

Related Research Articles

Amicable numbers Pair of integers related by their divisors

Amicable numbers are two different natural numbers related in such a way that the sum of the proper divisors of each is equal to the other number. That is, σ(a)=b and σ(b)=a, where σ(n) is equal to the sum of positive divisors of n.

Perfect number Integer equal to the sum of its proper divisors

In number theory, a perfect number is a positive integer that is equal to the sum of its positive divisors, excluding the number itself. For instance, 6 has divisors 1, 2 and 3, and 1 + 2 + 3 = 6, so 6 is a perfect number.

A highly composite number is a positive integer with more divisors than any smaller positive integer has. The related concept of largely composite number refers to a positive integer which has at least as many divisors as any smaller positive integer. The name can be somewhat misleading, as two highly composite numbers are not actually composite numbers.

Table of divisors

The tables below list all of the divisors of the numbers 1 to 1000.

Abundant number Number that is less than the sum of its proper divisors

In number theory, an abundant number or excessive number is a number for which the sum of its proper divisors is greater than the number. The integer 12 is the first abundant number. Its proper divisors are 1, 2, 3, 4 and 6 for a total of 16. The amount by which the sum exceeds the number is the abundance. The number 12 has an abundance of 4, for example.

Deficient number Number whose aliquot sum is less than itself

In number theory, a deficient number or defective number is a number n for which the sum of divisors of n is less than 2n. Equivalently, it is a number for which the sum of proper divisors is less than n. For example, the proper divisors of 8 are 1, 2, and 4, and their sum is less than 8, so 8 is deficient.

Semiperfect number

In number theory, a semiperfect number or pseudoperfect number is a natural number n that is equal to the sum of all or some of its proper divisors. A semiperfect number that is equal to the sum of all its proper divisors is a perfect number.

Weird number

In number theory, a weird number is a natural number that is abundant but not semiperfect.

Almost perfect number

In mathematics, an almost perfect number (sometimes also called slightly defective or least deficientnumber) is a natural number n such that the sum of all divisors of n (the sum-of-divisors function σ(n)) is equal to 2n − 1, the sum of all proper divisors of n, s(n) = σ(n) − n, then being equal to n − 1. The only known almost perfect numbers are powers of 2 with non-negative exponents (sequence A000079 in the OEIS). Therefore the only known odd almost perfect number is 20 = 1, and the only known even almost perfect numbers are those of the form 2k for some positive number k; however, it has not been shown that all almost perfect numbers are of this form. It is known that an odd almost perfect number greater than 1 would have at least six prime factors.

In mathematics, an aliquot sequence is a sequence of positive integers in which each term is the sum of the proper divisors of the previous term. If the sequence reaches the number 1, it ends, since the sum of the proper divisors of 1 is 0.

2000 is a natural number following 1999 and preceding 2001.

An untouchable number is a positive integer that cannot be expressed as the sum of all the proper divisors of any positive integer. That is, these numbers are not in the image of the aliquot sum function. Their study goes back at least to Abu Mansur al-Baghdadi, who observed that both 2 and 5 are untouchable.

Practical number Number such that it and all smaller numbers may be represented as sums of its distinct divisors

In number theory, a practical number or panarithmic number is a positive integer such that all smaller positive integers can be represented as sums of distinct divisors of . For example, 12 is a practical number because all the numbers from 1 to 11 can be expressed as sums of its divisors 1, 2, 3, 4, and 6: as well as these divisors themselves, we have 5 = 3 + 2, 7 = 6 + 1, 8 = 6 + 2, 9 = 6 + 3, 10 = 6 + 3 + 1, and 11 = 6 + 3 + 2.

In mathematics, a superabundant number is a certain kind of natural number. A natural number n is called superabundant precisely when, for all m < n

Colossally abundant number Concept in mathematics

In mathematics, a colossally abundant number is a natural number that, in a particular, rigorous sense, has many divisors. Formally, a number n is colossally abundant if and only if there is an ε > 0 such that for all k > 1,

Highly abundant number

In mathematics, a highly abundant number is a natural number with the property that the sum of its divisors is greater than the sum of the divisors of any smaller natural number.

In number theory, friendly numbers are two or more natural numbers with a common abundancy index, the ratio between the sum of divisors of a number and the number itself. Two numbers with the same "abundancy" form a friendly pair; n numbers with the same "abundancy" form a friendly n-tuple.

In number theory, the aliquot sums(n) of a positive integer n is the sum of all proper divisors of n, that is, all divisors of n other than n itself. That is,

In mathematics, specifically number theory, Granville numbers, also known as -perfect numbers, are an extension of the perfect numbers.

840 is the natural number following 839 and preceding 841.

References

  1. Weisstein, Eric W. "Primitive Abundant Number". MathWorld .
  2. Erdős adopts a wider definition that requires a primitive abundant number to be not deficient, but not necessarily abundant (Erdős, Surányi and Guiduli. Topics in the Theory of Numbers p214. Springer 2003.). The Erdős definition allows perfect numbers to be primitive abundant numbers too.
  3. Paul Erdős, Journal of the London Mathematical Society 9 (1934) 278282.