Semiperfect number

From Wikipedia, the free encyclopedia
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 that is equal to the sum of all or some of its proper divisors. A semiperfect number that is 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, ... (sequence A005835 in the 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, ... (sequence A006036 in the 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 this is not the only form: for example, 770.Template:SfnpTemplate:Sfnp There are infinitely many odd primitive semiperfect numbers, the smallest being 945, a result of Paul Erdős.Template:Sfnp There are also 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

  • Script error: No such module "Citation/CS1".
  • Script error: No such module "citation/CS1". Section B2.
  • Script error: No such module "Citation/CS1".
  • Script error: No such module "Citation/CS1".

External links

  • Script error: No such module "Template wrapper".
  • Script error: No such module "Template wrapper".

Template:Divisor classes Template:Classes of natural numbers

de:Vollkommene Zahl#Pseudovollkommene Zahlen