Semiperfect number

From Vero - Wikipedia
Revision as of 09:00, 4 September 2025 by imported>Meters (Reverted edit by 188.27.154.167 (talk) to last version by Jeruain)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description Template:Infobox integer sequence In number theory, a semiperfect number or pseudoperfect number is a natural number n equal to the sum of all or some of its proper divisors. A semiperfect number equal to the sum of all its proper divisors is a perfect number.

The first few semiperfect numbers are: 6, 12, 18, 20, 24, 28, 30, 36, 40, ... Template:OEIS

Properties

Primitive semiperfect numbers

A primitive semiperfect number (also called a primitive pseudoperfect number, irreducible semiperfect number or irreducible pseudoperfect number) is a semiperfect number that has no semiperfect proper divisor.Template:Sfnp

The first few primitive semiperfect numbers are 6, 20, 28, 88, 104, 272, 304, 350, ... Template:OEIS

There are infinitely many such numbers. All numbers of the form 2mp, with p a prime between 2m and 2m+1, are primitive semiperfect, but not all primitive semiperfect numbers follow this form; for example, 770.Template:SfnpTemplate:Sfnp There are infinitely many odd primitive semiperfect numbers, the smallest being 945. There are infinitely many primitive semiperfect numbers that are not harmonic divisor numbers.Template:Sfnp

Every semiperfect number is a multiple of a primitive semiperfect number.

See also

Notes

Template:Reflist

References

Template:Divisor classes Template:Classes of natural numbers

de:Vollkommene Zahl#Pseudovollkommene Zahlen