Quasiperfect number
Appearance
In
sum-of-divisors function
) is equal to . Equivalently, n is the sum of its non-trivial divisors (that is, its divisors excluding 1 and n). No quasiperfect numbers have been found so far.
The quasiperfect numbers are the abundant numbers of minimal abundance (which is 1).
Theorems
If a quasiperfect number exists, it must be an
prime factors.[1]
Related
For a perfect number n the sum of all its divisors is equal to . For an almost perfect number n the sum of all its divisors is equal to .
Numbers n whose sum of factors equals are known to exist. They are of form where is a prime. The only exception known so far is . They are 20, 104, 464, 650, 1952, 130304, 522752, ... (sequence A088831 in the OEIS). Numbers n whose sum of factors equals are also known to exist. They are of form where is prime. No exceptions are found so far. Because of the five known
Fermat primes, there are five such numbers known: 3, 10, 136, 32896 and 2147516416 (sequence A191363 in the OEIS
)
Betrothed numbers relate to quasiperfect numbers like amicable numbers relate to perfect numbers.
Notes
- MR 0668448.
References
- Brown, E.; Abbott, H.; Aull, C.; Suryanarayana, D. (1973). "Quasiperfect numbers" (PDF). Acta Arith. 22 (4): 439–447. MR 0316368.
- Kishore, Masao (1978). "Odd integers N with five distinct prime factors for which 2−10−12 < σ(N)/N < 2+10−12" (PDF). Zbl 0376.10005.
- Cohen, Graeme L. (1980). "On odd perfect numbers (ii), multiperfect numbers and quasiperfect numbers". J. Austral. Math. Soc. Ser. A. 29 (3): 369–384. Zbl 0425.10005.
- James J. Tattersall (1999). Elementary number theory in nine chapters. Zbl 0958.11001.
- ISBN 0-387-20860-7.
- Sándor, József; Mitrinović, Dragoslav S.; Crstici, Borislav, eds. (2006). Handbook of number theory I. Dordrecht: Zbl 1151.11300.