Weird number

Template:Short description Template:Euler diagram numbers with many divisors.svgIn number theory, a weird number is a natural number that is abundant but not semiperfect.<ref> Template:Cite journal</ref><ref>Template:Cite book Section B2.</ref> 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.

Examples

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 several weird numbers are

70, 836, 4030, 5830, 7192, 7912, 9272, 10430, 10570, 10792, 10990, 11410, 11690, 12110, 12530, 12670, 13370, 13510, 13790, 13930, 14770, ... (sequence A006037 in the OEIS).

Properties

Template:Unsolved Infinitely many weird numbers exist.<ref>Template:Cite book</ref> For example, 70p is weird for all primes p ≥ 149. In fact, the set of weird numbers has positive asymptotic density.<ref name="benk1"> Template:Cite journal </ref>

It is not known if any odd weird numbers exist. If so, they must be greater than 10²¹.<ref>Template:Cite OEIS -- comments concerning odd weird numbers</ref>

Sidney Kravitz has shown that for k a positive integer, Q a prime exceeding 2^k, and

<math>R = \frac{2^kQ-(Q+1)}{(Q+1)-2^k}</math>

also prime and greater than 2^k, then

<math>n = 2^{k-1}QR</math>

is a weird number.<ref> Template:Cite journal</ref> With this formula, he found the large weird number

<math>n=2^{56}\cdot(2^{61}-1)\cdot153722867280912929\ \approx\ 2\cdot10^{52}.</math>

Primitive weird numbers

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.<ref name=benk1/> 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 <math>2^k p q</math> 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.<ref> Template:Cite journal</ref> Primitive weird numbers with as many as 16 prime factors and 14712 digits have been found.<ref> Template:Cite journal</ref>

See also

• Untouchable number

External links

• {{#invoke:Template wrapper|{{#if:|list|wrap}}|_template=cite web

|_exclude=urlname, _debug, id |url = https://mathworld.wolfram.com/{{#if:WeirdNumber%7CWeirdNumber.html}} |title = Weird number |author = Weisstein, Eric W. |website = MathWorld |access-date = |ref = Template:SfnRef }}