multiply perfect number

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 {{nowrap|3-perfect}} number.

The following table gives an overview of the smallest known {{nowrap|k-perfect}} numbers for k ≤ 11 {{OEIS|A007539}}:

It can be proven that:

• For a given prime number p, if n is {{nowrap|p-perfect}} and p does not divide n, then pn is {{nowrap|(p + 1)-perfect}}. This implies that an integer n is a {{nowrap|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 {{nowrap|4k-perfect}} and 3 does not divide n, then n is {{nowrap|3k-perfect}}.

{{Unsolved|mathematics|Are there any odd multiply perfect numbers?}}

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

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

Tóth found several numbers that would be odd multiperfect, if one of their factors was a square ({{harvtxt|Tóth|2025}}). An example is $8999757$, which would be an odd multiperfect number, if only one of its prime factors, $61$, was a square. This is closely related to the concept of Descartes numbers.

In little-o notation, the number of multiply perfect numbers less than x is $o(x^\backslash varepsilon)$ for all ε > 0.{{harvnb|Sándor|Mitrinović|Crstici|2006|p=105}}

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

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

:$\backslash log\backslash log\; n\; >\; k\backslash cdot\; e^\{-\backslash gamma\}$

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

The number of divisors τ(n) of a {{nowrap|k-perfect}} number n satisfies the inequality{{cite arXiv |last=Dagal |first=Keneth Adrian P. |eprint=1309.3527 |title=A Lower Bound for τ(n) for k-Multiperfect Number |class=math.NT |date=2013}}

:$\backslash tau(n)\; >\; e^\{k\; -\; \backslash gamma\}.$

The number of distinct prime factors ω(n) of n satisfies{{harvnb|Sándor|Mitrinović|Crstici|2006|p=106}}

:$\backslash omega(n)\; \backslash ge\; k^2-1.$

If the distinct prime factors of n are $p\_1,\; p\_2,\; \backslash ldots,\; p\_r$, then:

:

:

{{main|Perfect number}}

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

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 {{OEIS|A005820}}

If there exists an odd perfect number m (a famous open problem) then 2m would be {{nowrap|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⁵.{{harvnb|Sándor|Mitrinović|Crstici|2006|pp=108–109}}

A similar extension can be made for unitary perfect numbers. A positive integer n is called a unitary multi {{nowrap|k-perfect}} number if σ^*(n) = kn where σ^*(n) is the sum of its unitary divisors. (A divisor d of a number n is a unitary divisor if d and n/d share no common factors.).

A unitary multiply perfect number is simply a unitary multi {{nowrap|k-perfect}} number for some positive integer k. Equivalently, unitary multiply perfect numbers are those n for which n divides σ^*(n). A unitary multi {{nowrap|2-perfect}} number is naturally called a unitary perfect number. In the case k > 2, no example of a unitary multi {{nowrap|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 more than forty four odd prime factors. This problem is probably very difficult to settle. The concept of unitary divisor was originally due to R. Vaidyanathaswamy (1931) who called such a divisor as block factor. The present terminology is due to E. Cohen (1960).

The first few unitary multiply perfect numbers are:

:1, 6, 60, 90, 87360 {{OEIS|A327158}}

A positive integer n is called a bi-unitary multi {{nowrap|k-perfect}} number if σ^**(n) = kn where σ^**(n) is the sum of its bi-unitary divisors. This concept is due to Peter Hagis (1987). A bi-unitary multiply perfect number is simply a bi-unitary multi {{nowrap|k-perfect}} number for some positive integer k. Equivalently, bi-unitary multiply perfect numbers are those n for which n divides σ^**(n). A bi-unitary multi {{nowrap|2-perfect}} number is naturally called a bi-unitary perfect number, and a bi-unitary multi {{nowrap|3-perfect}} number is called a bi-unitary triperfect number.

A divisor d of a positive integer n is called a bi-unitary divisor of n if the greatest common unitary divisor (gcud) of d and n/d equals 1. This concept is due to D. Surynarayana (1972). The sum of the (positive) bi-unitary divisors of n is denoted by σ^**(n).

Peter Hagis (1987) proved that there are no odd bi-unitary multiperfect numbers other than 1. Haukkanen and Sitaramaiah (2020) found all bi-unitary triperfect numbers of the form 2^au where 1 ≤ a ≤ 6 and u is odd,{{harvnb|Haukkanen|Sitaramaiah|2020a}}{{harvnb|Haukkanen|Sitaramaiah|2020b}}{{harvnb|Haukkanen|Sitaramaiah|2020c}} and partially the case where a = 7.{{harvnb|Haukkanen|Sitaramaiah|2020d}}

{{harvnb|Haukkanen|Sitaramaiah|2021a}}

Further, they fixed completely the case a = 8.{{harvnb|Haukkanen|Sitaramaiah|2021b}}

Tomohiro Yamada (Determining all biunitary triperfect numbers of a certain form, arXiv:2406.19331 [math.NT], 2024) proved that 2160 = 3³ 80 is the only biunitary triperfect number of the form 3^au where 3 ≤ a and u is not divisible by 3.

The first few bi-unitary multiply perfect numbers are:

:1, 6, 60, 90, 120, 672, 2160, 10080, 22848, 30240 {{OEIS|A189000}}

{{reflist}}

• {{cite journal

|first1=Kevin A.

|last1=Broughan

|first2=Qizhi

|last2=Zhou

|title=Odd multiperfect numbers of abundancy 4

|journal= Journal of Number Theory

|doi=10.1016/j.jnt.2007.02.001

|year=2008

|mr=2419178

|volume=126

|number=6

|pages=1566–1575

|url=https://researchcommons.waikato.ac.nz/bitstream/10289/1796/1/Odd%20multiperfect%20numbers%20of%20abundancy%204.pdf

|hdl=10289/1796

|hdl-access=free

}}

• {{cite book |last=Guy | first=Richard K. | author-link=Richard K. Guy | title=Unsolved problems in number theory | publisher=Springer-Verlag |edition=3rd | year=2004 |isbn=978-0-387-20860-2 | zbl=1058.11001 | at=B2 }}
• {{cite journal

|first1=Pentti

|last1=Haukkanen

|first2=V.

|last2=Sitaramaiah

|title=Bi-unitary multiperfect numbers, I

|journal= Notes on Number Theory and Discrete Mathematics

|doi=10.7546/nntdm.2020.26.1.93-171

|year=2020a

|volume=26

|number=1

|pages=93–171

|url=http://nntdm.net/papers/nntdm-26/NNTDM-26-1-093-171.pdf

|doi-access=free

}}

• {{cite journal

|first1=Pentti

|last1=Haukkanen

|first2=V.

|last2=Sitaramaiah

|title=Bi-unitary multiperfect numbers, II

|journal= Notes on Number Theory and Discrete Mathematics

|doi=10.7546/nntdm.2020.26.2.1-26

|year=2020b

|volume=26

|number=2

|pages=1–26

|url=http://nntdm.net/papers/nntdm-26/NNTDM-26-2-001-026.pdf

|doi-access=free

}}

• {{cite journal

|first1=Pentti

|last1=Haukkanen

|first2=V.

|last2=Sitaramaiah

|title=Bi-unitary multiperfect numbers, III

|journal= Notes on Number Theory and Discrete Mathematics

|doi=10.7546/nntdm.2020.26.3.33-67

|year=2020c

|volume=26

|number=3

|pages=33–67

|url=http://nntdm.net/papers/nntdm-26/NNTDM-26-3-033-067.pdf

|doi-access=free

}}

• {{cite journal

|first1=Pentti

|last1=Haukkanen

|first2=V.

|last2=Sitaramaiah

|title=Bi-unitary multiperfect numbers, IV(a)

|journal= Notes on Number Theory and Discrete Mathematics

|doi=10.7546/nntdm.2020.26.4.2-32

|year=2020d

|volume=26

|number=4

|pages=2–32

|url=https://nntdm.net/papers/nntdm-26/NNTDM-26-4-002-032.pdf

|doi-access=free

}}

• {{cite journal

|first1=Pentti

|last1=Haukkanen

|first2=V.

|last2=Sitaramaiah

|title=Bi-unitary multiperfect numbers, IV(b)

|journal= Notes on Number Theory and Discrete Mathematics

|doi=10.7546/nntdm.2021.27.1.45-69

|year=2021a

|volume=27

|number=1

|pages=45–69

|url=https://nntdm.net/papers/nntdm-27/NNTDM-27-1-045-069.pdf

|doi-access=free

}}

• {{cite journal

|first1=Pentti

|last1=Haukkanen

|first2=V.

|last2=Sitaramaiah

|title=Bi-unitary multiperfect numbers, V

|journal= Notes on Number Theory and Discrete Mathematics

|doi=10.7546/nntdm.2021.27.2.20-40

|year=2021b

|volume=27

|number=2

|pages=20–40

|url=https://nntdm.net/papers/nntdm-27/NNTDM-27-2-020-040.pdf

|doi-access=free

}}

• {{cite journal | zbl=0612.10006 | last=Kishore | first=Masao | title=Odd triperfect numbers are divisible by twelve distinct prime factors | journal= Journal of the Australian Mathematical Society, Series A | volume=42 | issue=2 | pages=173–182 | year=1987 | issn=0263-6115 | doi=10.1017/s1446788700028184| doi-access=free }}
• {{cite journal

|first1=Richard

|last1=Laatsch

|title=Measuring the abundancy of integers

|journal=Mathematics Magazine

|jstor=2690424

|year=1986

|volume=59

|number=2

|pages=84–92

|mr=0835144| issn=0025-570X | zbl=0601.10003

|doi=10.2307/2690424}}

• {{cite journal

|first1=James G.

|last1=Merickel

|title= Divisors of Sums of Divisors: 10617

|journal= The American Mathematical Monthly

|year=1999

|jstor=2589515

|volume=106

|number=7

|page=693

|mr=1543520

|doi=10.2307/2589515

}}

• {{cite journal

|first1=Richard F.

|last1=Ryan

|title=A simpler dense proof regarding the abundancy index

|journal= Mathematics Magazine

|year=2003

|volume=76

|number=4

|pages=299–301

|doi=10.1080/0025570X.2003.11953197

|jstor=3219086

|mr=1573698

|s2cid=120960379

}}

• {{cite book | editor1-last=Sándor | editor1-first=Jozsef | editor2-last=Crstici | editor2-first=Borislav | title=Handbook of number theory II | url=https://archive.org/details/handbooknumberth00sand_741 | url-access=limited | location=Dordrecht | publisher=Kluwer Academic | year=2004 | isbn=1-4020-2546-7 | pages=[https://archive.org/details/handbooknumberth00sand_741/page/n33 32]–36 | zbl=1079.11001 }}
• {{cite book | editor1-last=Sándor | editor1-first=József | editor2-last=Mitrinović | editor2-first=Dragoslav S. | editor3-last=Crstici |editor3-first=Borislav | title=Handbook of number theory I | location=Dordrecht | publisher=Springer-Verlag | year=2006 | isbn=1-4020-4215-9 | zbl=1151.11300 }}
• {{Cite thesis|degree=PhD

|first1= Ronald M.

|last1=Sorli

|title=Algorithms in the study of multiperfect and odd perfect numbers

|year=2003

|hdl=10453/20034

|publisher=University of Technology|location= Sydney

}}

• {{cite journal|last=Tóth|first=László|title=Odd Spoof Multiperfect Numbers|journal=Integers|volume=25|year=2025|issue=A19 |arxiv=2502.16954|url=https://math.colgate.edu/~integers/z19/z19.pdf}}
• {{cite journal

|first1= Paul A.

|last1=Weiner

|title=The abundancy ratio, a measure of perfection

|journal= Mathematics Magazine

|year=2000

|jstor=2690980

|volume=73

|number=4

|pages=307–310

|mr=1573474

|doi=10.1080/0025570x.2000.11996860

|s2cid=119773896

}}

• Hemiperfect number

• [http://wwwhomes.uni-bielefeld.de/achim/mpn.html The Multiply Perfect Numbers page]
• [http://primes.utm.edu/glossary/page.php?sort=MultiplyPerfect The Prime Glossary: Multiply perfect numbers]
• {{YouTube|id=DhPtIf-hpuU|title=The Six Triperfect Numbers}}

{{Divisor classes}}

{{Classes of natural numbers}}

Category:Arithmetic dynamics

Category:Divisor function

Category:Perfect numbers