1001Ferramentas
🎯 Dev

Perfect Number Generator

List perfect numbers (where the sum of proper divisors equals the number itself) below a ceiling. Examples: 6, 28, 496, 8128.

Números perfeitos abaixo do teto via fórmula de Euclides-Euler com primos de Mersenne conhecidos.

Encontrados:

Perfect numbers and their link to Mersenne primes

A number is perfect when its proper divisors sum to itself. 6 is the first: 1 plus 2 plus 3. Next comes 28, then 496, then 8128 — and then the jump is brutal, because the fifth is 33,550,336. That rarity is what makes the subject interesting: only 51 perfect numbers are known, all found through a formula two thousand years old.

Euclid showed that when two to the p minus 1 is prime, then two to the p minus 1, multiplied by that prime, is perfect. Euler proved, two millennia later, that every even perfect number has exactly that shape. That is why the page generates the list from the known exponents: there is no other way to find them, and brute-force searching would be hopeless.

Primes of the form two to the p minus 1 are the Mersenne primes, and each one discovered yields a new perfect number. The search is carried out today by a distributed computing project, and the largest known has tens of millions of digits. The simplest question of all remains open: is there an odd perfect number? Nobody has found one, nobody has proved none exists, and it is known that if one exists it exceeds 1500 digits.

Frequently asked questions

Why are there only 51?
Because each depends on a Mersenne prime, and those are rare and expensive to verify. Testing whether two to the p minus 1 is prime needs a specialised test, Lucas-Lehmer, and even with it current candidates take weeks of processing. The number 51 is how many have been found, not how many exist.
Does every prime exponent give a perfect number?
No. The exponent must be prime, but that is not enough: 11 is prime and two to the 11 minus 1 is 2047, which is 23 times 89. Only exponents whose result is also prime qualify, and that is the list the page uses.
Are perfect numbers good for anything?
Direct practical application, essentially none. The value lies along the way: the hunt for Mersenne primes drove fast multiplication algorithms and primality tests that today underpin cryptography. It is a classic case of mathematics with no apparent application yielding applied tooling.

Related Tools