Quasiperfect number

From HandWiki
Short description: Numbers whose sum of divisors is twice the number plus 1
Unsolved problem in mathematics:
Do quasiperfect numbers exist?
(more unsolved problems in mathematics)

In mathematics, a quasiperfect number is a natural number n for which the sum of all its divisors (the sum-of-divisors function σ(n)) is equal to 2n+1. 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 odd square number greater than 1035 and have at least seven distinct prime factors.[1]

For a perfect number n the sum of all its divisors is equal to 2n. For an almost perfect number n the sum of all its divisors is equal to 2n1.

Numbers n whose sum of factors equals 2n+2 are known to exist. They are of form 2n1×(2n3) where 2n3 is a prime. The only exception known so far is 650=2×52×13. They are 20, 104, 464, 650, 1952, 130304, 522752, ... (sequence A088831 in the OEIS). Numbers n whose sum of factors equals 2n2 are also known to exist. They are of form 2n1×(2n+1) where 2n+1 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

  1. Hagis, Peter; Cohen, Graeme L. (1982). "Some results concerning quasiperfect numbers". J. Austral. Math. Soc. Ser. A 33 (2): 275–286. doi:10.1017/S1446788700018401. 

References