Quasiperfect number


Quasiperfect number

In mathematics, a quasiperfect number is a theoretical natural number "n" for which the sum of all its divisors (the divisor function "σ"("n")) is equal to 2"n" + 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 1038 and have at least seven distinct prime factors. [cite journal|author=Hagis, Peter & Cohen, Graeme L.,|title=Some results concerning quasiperfect numbers|journal=J. Austral. Math. Soc. Ser. A|volume=33|year=1982|pages=275–286]

Notes

References

*


Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… …   Wikipedia

  • Perfect number — In number theory, a perfect number is a positive integer that is equal to the sum of its proper positive divisors, that is, the sum of its positive divisors excluding the number itself (also known as its aliquot sum). Equivalently, a perfect… …   Wikipedia

  • Highly composite number — This article is about numbers having many divisors. For numbers factorized only to powers of 2, 3, 5 and 7 (also named 7 smooth numbers), see Smooth number. A highly composite number (HCN) is a positive integer with more divisors than any… …   Wikipedia

  • List of recreational number theory topics — This is a list of recreational number theory topics (see number theory, recreational mathematics). Listing here is not pejorative: many famous topics in number theory have origins in challenging problems posed purely for their own sake. See list… …   Wikipedia

  • Composite number — A composite number is a positive integer which has a positive divisor other than one or itself. In other words a composite number is any positive integer greater than one that is not a prime number. So, if n > 0 is an integer and… …   Wikipedia

  • Multiply perfect number — In mathematics, a multiply perfect number (also called multiperfect number or pluperfect number) is a generalization of a perfect number. For a given natural number k, a number n is called k perfect (or k fold perfect) if and only if the sum of… …   Wikipedia

  • Deficient number — In number theory, a deficient number or defective number is a number n for which the sum of divisors σ(n)<2n, or, equivalently, the sum of proper divisors (or aliquot sum) s(n)<n. The value 2n − σ(n) (or n − s(n)) is… …   Wikipedia

  • Harmonic divisor number — This article is about harmonic divisor numbers. For meanings of harmonic number, see harmonic number (disambiguation). In mathematics, a harmonic divisor number, or Ore number (named after Øystein Ore who defined it in 1948), is a positive… …   Wikipedia

  • Pronic number — A pronic number, oblong number, rectangular number or heteromecic number, is a number which is the product of two consecutive integers, that is, n (n + 1). The n th pronic number is twice the n th triangular number and n more than… …   Wikipedia

  • Colossally abundant number — In mathematics, a colossally abundant number (sometimes abbreviated as CA) is a natural number that, in some rigorous sense, has a lot of divisors. Formally, a number n is colossally abundant if and only if there is an ε > 0 such… …   Wikipedia


Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.