Top Qs
Timeline
Chat
Perspective
Hyperperfect number
Type of natural number From Wikipedia, the free encyclopedia
Remove ads
In number theory, a k-hyperperfect number is a natural number n for which the equality holds, where σ(n) is the divisor function (i.e., the sum of all positive divisors of n). A hyperperfect number is a k-hyperperfect number for some integer k. Hyperperfect numbers generalize perfect numbers, which are 1-hyperperfect.[1]
The first few numbers in the sequence of k-hyperperfect numbers are 6, 21, 28, 301, 325, 496, 697, ... (sequence A034897 in the OEIS), with the corresponding values of k being 1, 2, 1, 6, 3, 1, 12, ... (sequence A034898 in the OEIS). The first few k-hyperperfect numbers that are not perfect are 21, 301, 325, 697, 1333, ... (sequence A007592 in the OEIS).
Remove ads
List of hyperperfect numbers
Summarize
Perspective
The following table lists the first few k-hyperperfect numbers for some values of k, together with the sequence number in the On-Line Encyclopedia of Integer Sequences (OEIS) of the sequence of k-hyperperfect numbers:
It can be shown that if k > 1 is an odd integer and and are prime numbers, then is k-hyperperfect; Judson S. McCranie has conjectured in 2000 that all k-hyperperfect numbers for odd k > 1 are of this form, but the hypothesis has not been proven so far. Furthermore, it can be proven that if p ≠ q are odd primes and k is an integer such that then pq is k-hyperperfect.
It is also possible to show that if k > 0 and is prime, then for all i > 1 such that is prime, is k-hyperperfect. The following table lists known values of k and corresponding values of i for which n is k-hyperperfect:
Remove ads
References
Further reading
External links
Wikiwand - on
Seamless Wikipedia browsing. On steroids.
Remove ads