Multiply perfect number

Demonstration, with Cuisenaire rods, of the 2-perfection of the number 6

In mathematics, a multiply perfect number (also called multiperfect number or pluperfect number) is a generalization of a perfect number.

For a given natural number k, a number n is called k-perfect (or k-fold perfect) if the sum of all positive divisors of n (the divisor function, σ(n)) is equal to kn; a number is thus perfect if and only if it is 2-perfect. A number that is k-perfect for a certain k is called a multiply perfect number. As of 2014, k-perfect numbers are known for each value of k up to 11. ^[1]

It is unknown whether there are any odd multiply perfect numbers other than 1. The first few multiply perfect numbers are:

1, 6, 28, 120, 496, 672, 8128, 30240, 32760, 523776, 2178540, 23569920, 33550336, 45532800, 142990848, 459818240, ... (sequence A007691 in the OEIS ).

Example

The sum of the divisors of 120 is

1 + 2 + 3 + 4 + 5 + 6 + 8 + 10 + 12 + 15 + 20 + 24 + 30 + 40 + 60 + 120 = 360

which is 3 × 120. Therefore 120 is a 3-perfect number.

Smallest known k-perfect numbers

The following table gives an overview of the smallest known k-perfect numbers for k ≤ 11 (sequence A007539 in the OEIS ):

k	Smallest k-perfect number	Factors	Found by
1	1		ancient
2	6	2 × 3	ancient
3	120	23 × 3 × 5	ancient
4	30240	25 × 33 × 5 × 7	René Descartes, circa 1638
5	14182439040	27 × 34 × 5 × 7 × 112 × 17 × 19	René Descartes, circa 1638
6	154345556085770649600 (21 digits)	215 × 35 × 52 × 72 × 11 × 13 × 17 × 19 × 31 × 43 × 257	Robert Daniel Carmichael, 1907
7	141310897947438348259849...523264343544818565120000 (57 digits)	232 × 311 × 54 × 75 × 112 × 132 × 17 × 193 × 23 × 31 × 37 × 43 × 61 × 71 × 73 × 89 × 181 × 2141 × 599479	TE Mason, 1911
8	826809968707776137289924...057256213348352000000000 (133 digits)	262 × 315 × 59 × 77 × 113 × 133 × 172 × 19 × 23 × 29 × ... × 487 × 5212 × 601 × 1201 × 1279 × 2557 × 3169 × 5113 × 92737 × 649657 (38 distinct prime factors)	Stephen F. Gretton, 1990 [1]
9	561308081837371589999987...415685343739904000000000 (287 digits)	2104 × 343 × 59 × 712 × 116 × 134 × 17 × 194 × 232 × 29 × ... × 17351 × 29191 × 30941 × 45319 × 106681 × 110563 × 122921 × 152041 × 570461 × 16148168401 (66 distinct prime factors)	Fred Helenius, 1995 [1]
10	448565429898310924320164...000000000000000000000000 (639 digits)	2175 × 369 × 529 × 718 × 1119 × 138 × 179 × 197 × 239 × 293 × ... × 583367 × 1609669 × 3500201 × 119782433 × 212601841 × 2664097031 × 2931542417 × 43872038849 × 374857981681 × 4534166740403 (115 distinct prime factors)	George Woltman, 2013 [1]
11	312633142338546946283331...000000000000000000000000 (1739 digits)	2413 × 3145 × 573 × 749 × 1127 × 1322 × 1711 × 1913 × 2310 × 299 × ... × 31280679788951 × 42166482463639 × 45920153384867 × 9460375336977361 × 18977800907065531 × 79787519018560501 × 455467221769572743 × 2519545342349331183143 × 38488154120055537150068589763279 × 6113142872404227834840443898241613032969 (241 distinct prime factors)	George Woltman, 2022 [1]

Properties

It can be proven that:

• For a given prime number p, if n is p-perfect and p does not divide n, then pn is (p + 1)-perfect. This implies that an integer n is a 3-perfect number divisible by 2 but not by 4, if and only if n/2 is an odd perfect number, of which none are known.
• If 3n is 4k-perfect and 3 does not divide n, then n is 3k-perfect.

Odd multiply perfect numbers

Unsolved problem in mathematics

Are there any odd multiply perfect numbers?

More unsolved problems in mathematics

It is unknown whether there are any odd multiply perfect numbers other than 1. However if an odd k-perfect number n exists where k > 2, then it must satisfy the following conditions: ^[2]

• The largest prime factor is ≥ 100129
• The second largest prime factor is ≥ 1009
• The third largest prime factor is ≥ 101

If an odd triperfect number exists, it must be greater than 10¹²⁸. ^[3]

Tóth found several numbers that would be odd multiperfect, if one of their factors was a square. An example is 8999757, which would be an odd multiperfect number, if only one of its prime factors, 61, was a square. ^[4] This is closely related to the concept of Descartes numbers.

Bounds

In little-o notation, the number of multiply perfect numbers less than x is ${\displaystyle o(x^{\varepsilon })}$ for all ε > 0. ^[2]

The number of k-perfect numbers n for n ≤ x is less than ${\displaystyle cx^{c'\log \log \log x/\log \log x}}$, where c and c' are constants independent of k. ^[2]

Under the assumption of the Riemann hypothesis, the following inequality is true for all k-perfect numbers n, where k > 3

${\displaystyle \log \log n>k\cdot e^{-\gamma }}$

where ${\displaystyle \gamma }$ is Euler's gamma constant. This can be proven using Robin's theorem.

The number of divisors τ(n) of a k-perfect number n satisfies the inequality ^[5]

${\displaystyle \tau (n)>e^{k-\gamma }.}$

The number of distinct prime factors ω(n) of n satisfies ^[6]

${\displaystyle \omega (n)\geq k^{2}-1.}$

If the distinct prime factors of n are ${\displaystyle p_{1},p_{2},\ldots ,p_{r}}$, then: ^[6]

${\displaystyle r\left({\sqrt[{r}]{3/2}}-1\right)<\sum _{i=1}^{r}{\frac {1}{p_{i}}}<r\left(1-{\sqrt[{r}]{6/k^{2}}}\right),~~{\text{if }}n{\text{ is even}}}$

${\displaystyle r\left({\sqrt[{3r}]{k^{2}}}-1\right)<\sum _{i=1}^{r}{\frac {1}{p_{i}}}<r\left(1-{\sqrt[{r}]{8/(k\pi ^{2})}}\right),~~{\text{if }}n{\text{ is odd}}}$

Specific values of k

Perfect numbers

Main article: Perfect number

A number n with σ(n) = 2n is perfect.

Triperfect numbers

A number n with σ(n) = 3n is triperfect. There are only six known triperfect numbers and these are believed to comprise all such numbers:

120, 672, 523776, 459818240, 1476304896, 51001180160 (sequence A005820 in the OEIS )

If there exists an odd perfect number m (a famous open problem) then 2m would be 3-perfect, since σ(2m) = σ(2)σ(m) = 3×2m. An odd triperfect number must be a square number exceeding 10⁷⁰ and have at least 12 distinct prime factors, the largest exceeding 10⁵. ^[7]

Variations

Unitary multiply perfect numbers

A similar extension can be made for unitary perfect numbers. A positive integer n is called a unitary multik-perfectnumber if σ^*(n) = kn where σ^*(n) is the sum of its unitary divisors. A unitary multiply perfect number is a unitary multi k-perfect number for some positive integer k. A unitary multi 2-perfect number is also called a unitary perfect number.

In the case k > 2, no example of a unitary multi k-perfect number is yet known. It is known that if such a number exists, it must be even and greater than 10¹⁰² and must have at least 45 odd prime factors. ^[8]

The first few unitary multiply perfect numbers are:

1, 6, 60, 90, 87360 (sequence A327158 in the OEIS )

Bi-unitary multiply perfect numbers

A positive integer n is called a bi-unitary multik-perfectnumber if σ^**(n) = kn where σ^**(n) is the sum of its bi-unitary divisors. A bi-unitary multiply perfect number is a bi-unitary multi k-perfect number for some positive integer k. ^[9] A bi-unitary multi 2-perfect number is also called a bi-unitary perfect number, and a bi-unitary multi 3-perfect number is called a bi-unitary triperfect number.

In 1987, Peter Hagis proved that there are no odd bi-unitary multiperfect numbers other than 1. ^[9]

In 2020, Haukkanen and Sitaramaiah studied bi-unitary triperfect numbers of the form 2^au where u is odd. They completely resolved the cases 1 ≤ a ≤ 6 and a = 8, and partially resolved the case a = 7. ^{[10] [11] [12] [13] [14] [15]}

In 2024, Tomohiro Yamada proved that 2160 is the only bi-unitary triperfect number divisible by 27 = 3³. ^[16]

The first few bi-unitary multiply perfect numbers are:

1, 6, 60, 90, 120, 672, 2160, 10080, 22848, 30240 (sequence A189000 in the OEIS )

References

1. Flammenkamp, Achim. "The Multiply Perfect Numbers Page" . Retrieved 22 January 2014.
2. Sándor, Mitrinović & Crstici 2006 , p. 105
3. Sorli, Ronald. "Algorithms in the Study of Multiperfect and Odd Perfect Numbers" (PDF). University of Technology, Sydney. Retrieved 11 July 2025.
4. Tóth (2025)
5. Dagal, Keneth Adrian P. (2013). "A Lower Bound for τ(n) for k-Multiperfect Number". arXiv: 1309.3527 [math.NT].
6. Sándor, Mitrinović & Crstici 2006 , p. 106
7. Sándor, Mitrinović & Crstici 2006 , pp. 108–109
8. Hagis Jr., Peter (1984). "Lower Bounds for Unitary Multiperfect Numbers" (PDF). The Fibonacci Quarterly. 22 (2): 140–143. Retrieved 10 July 2025.
9. Hagis Jr., Peter (1987). "Bi-Unitary Amicable and Multiperfect Numbers" (PDF). The Fibonacci Quarterly. 25 (2): 144–150. Retrieved 10 July 2025.
10. Haukkanen & Sitaramaiah 2020a
11. Haukkanen & Sitaramaiah 2020b
12. Haukkanen & Sitaramaiah 2020c
13. Haukkanen & Sitaramaiah 2020d
14. Haukkanen & Sitaramaiah 2021a
15. Haukkanen & Sitaramaiah 2021b
16. Yamada, Tomohiro (2024). "Determining all biunitary triperfect numbers of a certain form". arXiv: 2406.19331 [math.NT].

Sources

• Broughan, Kevin A.; Zhou, Qizhi (2008). "Odd multiperfect numbers of abundancy 4" (PDF). Journal of Number Theory. 126 (6): 1566–1575. doi:10.1016/j.jnt.2007.02.001. hdl: 10289/1796 . MR   2419178.
• Guy, Richard K. (2004). Unsolved problems in number theory (3rd ed.). Springer-Verlag. B2. ISBN   978-0-387-20860-2. Zbl   1058.11001.
• Haukkanen, Pentti; Sitaramaiah, V. (2020a). "Bi-unitary multiperfect numbers, I" (PDF). Notes on Number Theory and Discrete Mathematics. 26 (1): 93–171. doi: 10.7546/nntdm.2020.26.1.93-171 .
• Haukkanen, Pentti; Sitaramaiah, V. (2020b). "Bi-unitary multiperfect numbers, II" (PDF). Notes on Number Theory and Discrete Mathematics. 26 (2): 1–26. doi: 10.7546/nntdm.2020.26.2.1-26 .
• Haukkanen, Pentti; Sitaramaiah, V. (2020c). "Bi-unitary multiperfect numbers, III" (PDF). Notes on Number Theory and Discrete Mathematics. 26 (3): 33–67. doi: 10.7546/nntdm.2020.26.3.33-67 .
• Haukkanen, Pentti; Sitaramaiah, V. (2020d). "Bi-unitary multiperfect numbers, IV(a)" (PDF). Notes on Number Theory and Discrete Mathematics. 26 (4): 2–32. doi: 10.7546/nntdm.2020.26.4.2-32 .
• Haukkanen, Pentti; Sitaramaiah, V. (2021a). "Bi-unitary multiperfect numbers, IV(b)" (PDF). Notes on Number Theory and Discrete Mathematics. 27 (1): 45–69. doi: 10.7546/nntdm.2021.27.1.45-69 .
• Haukkanen, Pentti; Sitaramaiah, V. (2021b). "Bi-unitary multiperfect numbers, V" (PDF). Notes on Number Theory and Discrete Mathematics. 27 (2): 20–40. doi: 10.7546/nntdm.2021.27.2.20-40 .
• Kishore, Masao (1987). "Odd triperfect numbers are divisible by twelve distinct prime factors". Journal of the Australian Mathematical Society, Series A. 42 (2): 173–182. doi: 10.1017/s1446788700028184 . ISSN   0263-6115. Zbl   0612.10006.
• Laatsch, Richard (1986). "Measuring the abundancy of integers". Mathematics Magazine . 59 (2): 84–92. doi:10.2307/2690424. ISSN   0025-570X. JSTOR   2690424. MR   0835144. Zbl   0601.10003.
• Merickel, James G. (1999). "Divisors of Sums of Divisors: 10617". The American Mathematical Monthly. 106 (7): 693. doi:10.2307/2589515. JSTOR   2589515. MR   1543520.
• Ryan, Richard F. (2003). "A simpler dense proof regarding the abundancy index". Mathematics Magazine. 76 (4): 299–301. doi:10.1080/0025570X.2003.11953197. JSTOR   3219086. MR   1573698. S2CID   120960379.
• Sándor, Jozsef; Crstici, Borislav, eds. (2004). Handbook of number theory II . Dordrecht: Kluwer Academic. pp.  32–36. ISBN   1-4020-2546-7. Zbl   1079.11001.
• Sándor, József; Mitrinović, Dragoslav S.; Crstici, Borislav, eds. (2006). Handbook of number theory I. Dordrecht: Springer-Verlag. ISBN   1-4020-4215-9. Zbl   1151.11300.
• Sorli, Ronald M. (2003). Algorithms in the study of multiperfect and odd perfect numbers (PhD thesis). Sydney: University of Technology. hdl:10453/20034.
• Tóth, László (2025). "Odd Spoof Multiperfect Numbers" (PDF). Integers. 25 (A19). arXiv: 2502.16954 .
• Weiner, Paul A. (2000). "The abundancy ratio, a measure of perfection". Mathematics Magazine. 73 (4): 307–310. doi:10.1080/0025570x.2000.11996860. JSTOR   2690980. MR   1573474. S2CID   119773896.

See also

• Hemiperfect number

External links

• The Multiply Perfect Numbers page
• The Prime Glossary: Multiply perfect numbers
• The Six Triperfect Numbers on YouTube