Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Unitary perfect number
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Properties== There are no [[parity (mathematics)|odd]] unitary perfect numbers. This follows since 2<sup>''d''*(''n'')</sup> divides the sum of the unitary divisors of an odd number ''n'', where ''d''*(''n'') is the number of distinct [[prime number|prime]] factors of ''n''. One gets this because the sum of all the unitary divisors is a [[multiplicative function]] and one has that the sum of the unitary divisors of a [[prime power]] ''p''<sup>''a''</sup> is ''p''<sup>''a''</sup> + 1 which is [[parity (mathematics)|even]] for all odd primes ''p''. Therefore, an odd unitary perfect number must have only one distinct prime factor, and it is not hard to show that a power of prime cannot be a unitary perfect number, since there are not enough divisors. It is not known whether or not there are infinitely many unitary perfect numbers, or indeed whether there are any further examples beyond the five already known. A sixth such number would have at least nine distinct odd prime factors.<ref name=Wall1988>{{cite journal | last=Wall | first=Charles R. | title=New unitary perfect numbers have at least nine odd components | journal=[[Fibonacci Quarterly]] | volume=26 | number=4 | pages=312β317 | year=1988 | doi=10.1080/00150517.1988.12429611 | issn=0015-0517 | mr=967649 | zbl=0657.10003 }}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)