A superperfect number is a positive integer such that
where
is the divisor function giving the sum
of the positive divisors of
. Even superperfect numbers
are just
,
where
is a Mersenne prime. If any odd
superperfect numbers exist, they are square numbers
and either
or
is divisible by at least three distinct primes
(Dandapat et al. 1975, pp. 360 and 363).
For positive integers and
, write
and
. More generally, an
-superperfect (or (
, 2)-superperfect) number is a positive
integer
for which
,
and an
-perfect
number is a positive integer
for which
. A number
can be tested to see if it is
-perfect using the following Wolfram
Language code:
SuperperfectQ[m_, n_, k_:2] :=
Nest[DivisorSigma[1, #]&, n, m] == k n
The first few (2, 2)-perfect numbers are 2, 4, 16, 64, 4096, 65536, 262144, ... (OEIS A019279; Cohen and te Riele 1996, p. 93).
For ,
there are no even
-superperfect numbers (Guy 1994, p. 65). On the basis
of computer searches, J. McCranie reported that there are no
-superperfect numbers less than
for any
(J. McCranie, pers. comm., Nov. 11, 2001).
McCranie further conjectured that there are no
-superperfect numbers for
.