Skip to content
Allin
Sign up · Sign in

List of prime numbers

List every prime number up to a chosen limit, using the Sieve of Eratosthenes. Enter an upper bound (up to 100,000) and it returns all primes at or below it, how many there are and their sum — a quick reference for factoring and number theory.

Related tools

All Numbers & arithmetic tools →
First n prime numbersList the first n prime numbers — the building blocks of arithmetic that have no divisors but 1 and themselves. Enter how many you want (up to 10,000) and it returns the sequence, the nth prime itself and the sum of them all.Cube numbers listGenerate a list of perfect cubes — n³ for consecutive integers from any starting point. Set how many you want and where to start, and it returns the cubes, their sum and the underlying roots, computed with exact big-integer arithmetic.List of Fibonacci numbersGenerate the first n Fibonacci numbers exactly, with big-integer precision — each term the sum of the two before it, starting 0, 1, 1, 2, 3, 5, 8… The sequence hides the golden ratio and shows up throughout nature and mathematics. Returns the list and its sum.Square numbers listGenerate a list of perfect squares — n² for consecutive integers from any starting point. Choose how many and where to begin, and it returns the squares and their sum with exact big-integer arithmetic, handy for spotting patterns and differences.Twin prime finderFind every pair of twin primes up to a limit — primes that differ by exactly 2, like (11, 13) or (17, 19). Enter an upper bound (up to 1,000,000) and it lists the pairs and counts them. Whether infinitely many exist is one of the oldest open problems in mathematics.Prime factorization calculatorBreak a whole number down into the product of its prime factors.Prime number checkerCheck whether a number is prime and find its smallest divisor.Mersenne Prime CheckerRun the Lucas-Lehmer test on 2^p - 1 for any exponent p up to 5000, with the digit count, the rank in the known list and the even perfect number it generates.

The List of prime numbers turns Upper limit (2–100000) into Prime numbers, How many primes, Sum, instantly and for free. For instance, with Upper limit (2–100000) = 100 it returns Prime numbers = 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, How many primes = 25 and Sum = 1,060.

How to use it

  1. Enter your values: Upper limit (2–100000).
  2. Read the result instantly: Prime numbers, How many primes, Sum.

Frequently asked questions

What does the List of prime numbers actually compute?

It takes Upper limit (2–100000) and derives Prime numbers, How many primes and Sum from them. The calculation is live as you type, so the result updates on every change.

What information do I need to provide?

A single value: Upper limit (2–100000). Nothing else is required — no account, no file upload.

Can you show a worked example?

With Upper limit (2–100000) = 100, the calculator returns Prime numbers = 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, How many primes = 25 and Sum = 1,060. Those figures come from running this exact tool, so you can reproduce them by entering the same values.

What happens if I enter larger values?

It moves a lot. Using Upper limit (2–100000) = 200 instead, How many primes goes from 25 to 46 — which is why it is worth testing a few scenarios rather than trusting a single figure.

What does it give for smaller values?

Scaled down to Upper limit (2–100000) = 50, How many primes comes out at 15. The relationship is worth checking at both ends before you rely on a single result.

When would I actually use this?

Reading a number written another way: a Roman numeral on a monument, a hexadecimal colour, a binary byte, or a fraction that needs reducing.

What is the most common mistake?

Assuming a decimal fraction survives a change of base. A tenth is exact in decimal and infinitely repeating in binary, which is why 0.1 + 0.2 is not 0.3 in most programming languages.

What is the difference between the List of prime numbers and the First n prime numbers?

This one returns How many primes; the First n prime numbers returns The nth prime. That is the whole difference — open the one whose figure you need.

Is there a tool for the next step?

Cube numbers list is the closest one after this: Generate a list of perfect cubes — n³ for consecutive integers from any starting point. Set how many you want and where to start, and it returns the cubes, their sum and the underlying roots, computed with exact big-integer arithmetic.

What else is worth having open alongside it?

List of Fibonacci numbers and Square numbers list — they come up in the same task often enough to be worth a second tab.

Further reading

All guides →
How-toHow to Find Prime Factors: Factor Trees and the Division MethodBreak any whole number into its prime building blocks with a factor tree or repeated division — and write the result as a clean prime factorization with exponents.ExplainerSignificant Figures Explained: Counting, Rounding, and Why They MatterLearn what counts as a significant figure, the rules for leading, trailing, and captive zeros, and how sig figs keep your calculated answers honest.How-toHow to Multiply and Divide Fractions: Multiply Across, Flip to DivideMultiplying fractions needs no common denominator — just multiply across. Dividing means multiplying by the reciprocal. Learn both with worked examples and how to simplify.How-toHow to Round Numbers: Round Half Up, Round Half to Even, and MoreRound to any decimal place or number of significant figures, and learn when to use round half up versus round half to even to avoid bias.How-toHow to Add and Subtract Fractions: Common Denominator, Combine, SimplifyYou can only add or subtract fractions that share a denominator. Learn to find a common denominator, combine the numerators, and simplify the result, with a worked example.How-toHow to Do Long Division: Divide, Multiply, Subtract, Bring DownLong division breaks a big division into a repeating four-step cycle. Learn the divide-multiply-subtract-bring-down loop and how to read the remainder, with a worked example.