Skip to content

How Many Prime Numbers Are There?

  • Updated: August 3, 2026
📌

Complete guide: Prime Numbers List

There are infinitely many prime numbers. No matter how far the number line extends or how many primes have already been found, another prime always exists beyond every finite list.

There Are Infinitely Many Prime Numbers

Direct Answer

The number of prime numbers is infinite. There is no final prime number and no largest prime number.

A prime number is a whole number greater than 1 with exactly two positive divisors: 1 and itself. The sequence begins:

  • 2
  • 3
  • 5
  • 7
  • 11
  • 13
  • 17
  • 19
  • 23
  • 29

The primes become less frequent as numbers grow, but they never stop. This distinction matters: an infinite set can become sparse while still containing endlessly many members.

Why a Largest Prime Cannot Exist

Euclid gave the classic proof more than two thousand years ago. The argument begins by assuming that a complete finite list of primes exists, then shows that the list must be incomplete.

Euclid’s Construction

N = (p1 × p2 × … × pk) + 1

Suppose the alleged complete list is p1, p2, …, pk. Multiplying them together and adding 1 creates the number N. Dividing N by any prime in the list leaves a remainder of 1, so none of those listed primes divides N.

Two possibilities remain. N is prime, or N is composite and has a prime divisor. In either case, at least one prime exists that is not in the original list. The claim that the list contained every prime is therefore false.

Math Note

The constructed number N does not have to be prime. The proof only requires N to have a prime factor missing from the assumed complete list.

What “Infinitely Many” Means

No Final Prime

Every finite collection of primes can be extended.

No Largest Prime

Any named prime has larger primes somewhere beyond it.

Lower Density

Primes become rarer in proportion, yet their total number never becomes finite.

Infinity does not describe a particular number. It describes the fact that the list has no endpoint. Writing down a trillion primes would still produce only a finite initial portion of the full sequence.

How Many Primes Are Below a Given Number?

Although the total number of primes is infinite, the number of primes up to any fixed limit is finite. Mathematicians write this count as π(x), called the prime-counting function. It gives the number of primes less than or equal to x.

Exact prime counts for selected upper limits.
Upper Limit xπ(x)Prime Share Up to x
10440%
1002525%
1,00016816.8%
10,0001,22912.29%
100,0009,5929.592%
1,000,00078,4987.8498%
10,000,000664,5796.64579%
100,000,0005,761,4555.761455%
1,000,000,00050,847,5345.0847534%

The table shows two facts at once. The exact count keeps rising, while the percentage of integers that are prime falls. A decreasing percentage does not imply that primes eventually disappear.

Estimating the Count with the Prime Number Theorem

The prime number theorem describes the long-term distribution of primes. For large x, the value of π(x) is close to x divided by the natural logarithm of x.

Prime Count Approximation

π(x) ≈ x / log(x)

For x = 1,000,000, the approximation x / log(x) gives about 72,382, while the exact count is 78,498. The estimate improves in relative terms as x grows, though it is not an exact counting formula.

Why Primes Become Less Dense

Near a large number x, the chance that a randomly selected integer is prime is roughly 1 / log(x). This is an average description, not a test for individual numbers.

The same idea suggests that the average distance between nearby primes around x is roughly log(x). Actual prime gaps vary. Some consecutive primes are close together, while other intervals contain long runs of composite numbers.

Density Is Not a Prediction Rule

Prime density estimates how frequently primes occur across large ranges. It does not identify the next prime or prove that a particular candidate is prime.

Infinite Does Not Mean Predictable

Prime numbers follow exact definitions, but their locations are irregular. Simple patterns can filter candidates without proving primality. Every prime greater than 3 has the form 6n − 1 or 6n + 1, yet many numbers of those forms are composite.

Polynomial expressions can also produce long runs of primes and then fail. For example, n² + n + 41 gives prime values for many small nonnegative integers, but no nonconstant polynomial with integer coefficients produces a prime for every integer input.

To determine whether a particular integer is prime, divisibility methods or a suitable primality test are still needed. The prime number checker can test individual whole numbers directly.

Finite Prime Lists Still Have Practical Value

Any stored or displayed prime list is finite, even though the full set is infinite. Lists are useful for studying factors, testing algorithms, measuring prime gaps, and comparing how prime density changes across ranges.

For a bounded interval, primes can be counted exactly. The Sieve of Eratosthenes efficiently marks composite numbers across a range, while trial division or modern primality tests are better suited to many individual cases. The method depends on the size of the numbers and whether the task is counting, listing, or testing.

Related Ideas

Frequently Asked Questions

Is There a Largest Prime Number?

No. Euclid’s argument shows that every finite list of primes misses at least one prime, so a largest prime cannot exist.

Can Prime Numbers Eventually Run Out?

No. Prime numbers become less dense, but there are infinitely many of them.

How Many Prime Numbers Are Below 100?

There are 25 prime numbers less than or equal to 100.

How Many Prime Numbers Are Below 1,000?

There are 168 prime numbers less than or equal to 1,000.

Does the Percentage of Prime Numbers Approach Zero?

Yes. The proportion of integers up to x that are prime approaches zero as x grows, even though the number of primes itself is infinite.

Are There Infinitely Many Twin Primes?

This is not known. The twin prime conjecture states that infinitely many prime pairs differ by 2, but no proof has been found.

Can π(x) Be Calculated Exactly?

Yes. For any fixed finite x, π(x) has an exact integer value. Algorithms can count the primes up to x, while formulas such as x / log(x) provide estimates rather than exact results.