Primitive semiperfect number

In number theory, 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.

The first few primitive semiperfect numbers are 6, 20, 28, 88, 104, 272, 304, 350, ... (sequence A006036 in OEIS)

There are infinitely many odd primitive semiperfect numbers (the smallest is 945), as well as infinitely many primitive semiperfect numbers that are not harmonic divisor numbers.

External links

• Weisstein, Eric W., "Primitive semiperfect number" from MathWorld.

v · d · eDivisibility-based sets of integers Overview Integer factorization · Divisor · Unitary divisor · Divisor function · Prime factor · Fundamental theorem of arithmetic Forms of factorization Prime number · Composite number · Semiprime number · Pronic number · Sphenic number · Square-free number · Powerful number · Perfect power · Achilles number · Smooth number · Regular number · Rough number · Unusual number Constrained divisor sums Perfect number · Almost perfect number · Quasiperfect number · Multiply perfect number · Hyperperfect number · Superperfect number · Unitary perfect number · Semiperfect number · Primitive semiperfect number · Practical number Numbers with many divisors Abundant number · Primitive abundant number · Highly abundant number · Superabundant number · Colossally abundant number · Highly composite number · Superior highly composite number · Weird number Numbers related to aliquot sequences Untouchable number · Amicable number · Sociable number Other Deficient number · Friendly number · Solitary number · Sublime number · Harmonic divisor number · Frugal number · Equidigital number · Extravagant number