In number theory, a weird number is a natural number that is abundant but not semiperfect. [1] [2] In other words, the sum of the proper divisors (divisors including 1 but not itself) of the number is greater than the number, but no subset of those divisors sums to the number itself.
The smallest weird number is 70. Its proper divisors are 1, 2, 5, 7, 10, 14, and 35; these sum to 74, but no subset of these sums to 70. The number 12, for example, is abundant but not weird, because the proper divisors of 12 are 1, 2, 3, 4, and 6, which sum to 16; but 2 + 4 + 6 = 12.
The first few weird numbers are
Infinitely many weird numbers exist. [3] For example, 70p is weird for all primes p ≥ 149. In fact, the set of weird numbers has positive asymptotic density. [4]
It is not known if any odd weird numbers exist. If so, they must be greater than 1021. [5]
Sidney Kravitz has shown that for k a positive integer, Q a prime exceeding 2k, and
also prime and greater than 2k, then
is a weird number. [6] With this formula, he found the large weird number
A property of weird numbers is that if n is weird, and p is a prime greater than the sum of divisors σ(n), then pn is also weird. [4] This leads to the definition of primitive weird numbers: weird numbers that are not a multiple of other weird numbers (sequence A002975 in the OEIS ). Among the 1765 weird numbers less than one million, there are 24 primitive weird numbers. The construction of Kravitz yields primitive weird numbers, since all weird numbers of the form are primitive, but the existence of infinitely many k and Q which yield a prime R is not guaranteed. It is conjectured that there exist infinitely many primitive weird numbers, and Melfi has shown that the infinitude of primitive weird numbers is a consequence of Cramér's conjecture. [7] Primitive weird numbers with as many as 16 prime factors and 14712 digits have been found. [8]
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, s(a)=b and s(b)=a, where s(n)=σ(n)-n is equal to the sum of positive divisors of n except n itself (see also divisor function).
In mathematics, a square-free integer (or squarefree integer) is an integer which is divisible by no square number other than 1. That is, its prime factorization has exactly one factor for each prime that appears in it. For example, 10 = 2 ⋅ 5 is square-free, but 18 = 2 ⋅ 3 ⋅ 3 is not, because 18 is divisible by 9 = 32. The smallest positive square-free numbers are
A highly composite number is a positive integer that has more divisors than all smaller positive integers. A related concept is that of a largely composite number, a positive integer that has at least as many divisors as all smaller positive integers. The name can be somewhat misleading, as the first two highly composite numbers are not actually composite numbers; however, all further terms are.
In mathematics, a multiply perfect number is a generalization of a perfect number.
In number theory, an abundant number or excessive number is a positive integer 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.
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.
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 integer 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, and specifically in number theory, a divisor function is an arithmetic function related to the divisors of an integer. When referred to as the divisor function, it counts the number of divisors of an integer. It appears in a number of remarkable identities, including relationships on the Riemann zeta function and the Eisenstein series of modular forms. Divisor functions were studied by Ramanujan, who gave a number of important congruences and identities; these are treated separately in the article Ramanujan's sum.
104 is the natural number following 103 and preceding 105.
A unitary perfect number is an integer which is the sum of its positive proper unitary divisors, not including the number itself. Some perfect numbers are not unitary perfect numbers, and some unitary perfect numbers are not ordinary perfect numbers.
In mathematics, 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.
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 number theory, a colossally abundant number is a natural number that, in a particular, rigorous sense, has many divisors. Particularly, it is defined by a ratio between the sum of an integer's divisors and that integer raised to a power higher than one. For any such exponent, whichever integer has the highest ratio is a colossally abundant number. It is a stronger restriction than that of a superabundant number, but not strictly stronger than that of an abundant number.
Giuseppe Melfi is an Italo-Swiss mathematician who works on practical numbers and modular forms.
A Fibonacci prime is a Fibonacci number that is prime, a type of integer sequence prime.
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.
1728 is the natural number following 1727 and preceding 1729. It is a dozen gross, or one great gross. It is also the number of cubic inches in a cubic foot.
In number theory, Sylvester's sequence is an integer sequence in which each term is the product of the previous terms, plus one. Its first few terms are
In mathematics, and particularly in number theory, N is a primary pseudoperfect number if it satisfies the Egyptian fraction equation
In mathematics a primitive abundant number is an abundant number whose proper divisors are all deficient numbers.
Divisibility-based sets of integers | ||
|---|---|---|
| Overview |  | |
| Factorization forms | ||
| Constrained divisor sums | ||
| With many divisors | ||
| Aliquot sequence-related | ||
| Base-dependent | ||
| Other sets | ||
