Quasiperfect number
From Wikipedia, the free encyclopedia
| Divisibility-based sets of integers |
| Form of factorization: |
| Prime number |
| Composite number |
| Powerful number |
| Square-free number |
| Achilles number |
| Constrained divisor sums: |
| Perfect number |
| Almost perfect number |
| Quasiperfect number |
| Multiply perfect number |
| Hyperperfect number |
| Unitary perfect number |
| Semiperfect number |
| Primitive semiperfect number |
| Practical number |
| Numbers with many divisors: |
| Abundant number |
| Highly abundant number |
| Superabundant number |
| Colossally abundant number |
| Highly composite number |
| Superior highly composite number |
| Other: |
| Deficient number |
| Weird number |
| Amicable number |
| Sociable number |
| Sublime number |
| Harmonic divisor number |
| Frugal number |
| Equidigital number |
| Extravagant number |
| See also: |
| Divisor function |
| Divisor |
| Prime factor |
| Factorization |
In mathematics, a quasiperfect number is a natural number n for which the sum of all its divisors (the divisor function σ(n)) is equal to 2n + 1. Quasiperfect numbers are abundant numbers.
No quasiperfect numbers have been found so far, but if a quasiperfect number exists, it must be an odd square number greater than 1035 and have at least seven distinct prime factors. [1]
[edit] References
- Singh, S. Fermat's Enigma: The Epic Quest to Solve the World's Greatest Mathematical Problem (pg. 13), 1997.
