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?
Does every prime exponent give a perfect number?
Are perfect numbers good for anything?
Related Tools
First N Primes Generator
List the first N prime numbers using the Sieve of Eratosthenes. Useful for number-theory exercises, educational cryptography demos and algorithm testing. Runs in your browser.
Fibonacci Generator (first N)
Generate the first N Fibonacci numbers using BigInt for overflow-free output. Useful for didactics, algorithm testing and series analysis.
Prime Factorization Generator
Decompose N into prime factors with exponents (e.g., 360 = 2³·3²·5). Useful for LCM, GCD and number theory.
Divisors Generator
List all positive divisors of N. Shows total count and whether N is prime (only 2 divisors) or perfect.
Rollup Config Generator
Generates a rollup.config.js to bundle libraries as ESM and CommonJS, with the node-resolve, commonjs and terser plugins already wired. A fixed block, ready to tweak.
Range Header Parser
Decompose a Range header (bytes=0-499, bytes=-100, etc.) into individual ranges with start, end and size.