A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. By Euclid's theorem, there are an infinite number of prime numbers. Subsets of the prime numbers may be generated with various formulas for primes. The first 1000 primes are listed below, followed by lists of notable types of prime numbers in alphabetical order, giving their respective first terms. 1 is not prime nor composite.
The following table lists the first 1000 primes, with 20 columns of consecutive primes in each of the 50 rows.
(sequence in the OEIS).
The Goldbach conjecture verification project reports that it has computed all primes below 4×1018. That means 95,676,260,903,887,607 primes (nearly 1017), but they were not stored. There are known formulae to evaluate the prime-counting function (the number of primes below a given value) faster than computing the primes. This has been used to compute that there are 1,925,320,391,606,803,968,923 primes (roughly 2×1021) below 1023. A different computation found that there are 18,435,599,767,349,200,867,866 primes (roughly 2×1022) below 1024, if the Riemann hypothesis is true.
Below are listed the first prime numbers of many named forms and types. More details are in the article for the name. n is a natural number (including 0) in the definitions.
Primes such that the sum of digits is a prime.
2, 3, 5, 7, 11, 23, 29, 41, 43, 47, 61, 67, 83, 89, 101, 113, 131 ( )