There are known formulae to evaluate the prime-counting function (the number of primes below a given value) faster than computing the primes. The Goldbach conjecture verification project reports that it has computed all primes below 4×10 18. The following table lists the first 1000 primes, with 20 columns of consecutive primes in each of the 50 rows. The first 1000 primes are listed below, followed by lists of notable types of prime numbers in alphabetical order, giving their respective first terms.
Subsets of the prime numbers may be generated with various formulas for primes.
By Euclid's theorem, there are an infinite number of prime numbers. A prime number (or prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. This is a list of articles about prime numbers. You can help by adding missing items with reliable sources.
This is a dynamic list and may never be able to satisfy particular standards for completeness.
