Numbers whose sum of divisors is twice the number plus 1
In mathematics, a quasiperfect number is a natural numbern 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 oddsquare number greater than 1035 and have at least seven distinct prime factors.[1]
Related
For a perfect numbern the sum of all its divisors is equal to 2n. For an almost perfect numbern the sum of all its divisors is equal to 2n - 1.
Numbers n exist whose sum of factors = 2n + 2. They are of form 2^(n - 1) * (2^n - 3) where 2^n - 3 is a prime. The only exception known till yet is 650 = 2 * 5^2 * 13. They are 20, 104, 464, 650, 1952, 130304, 522752, etc. (OEIS A088831) Numbers n exist whose sum of factors = 2n - 2. They are of form 2^(n - 1) * (2^n + 1) where 2^n + 1 is prime. No exceptions are found till yet. Because of 5 known Fermat Primes, there are 5 known such numbers: 3, 10, 136, 32896 and 2147516416. (OEIS A191363)