Recent from talks
List of prime numbers
Knowledge base stats:
Talk channels stats:
Members stats:
List of prime numbers
This is a list of articles about prime numbers. A prime number (or 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 1,000 primes are listed below, followed by lists of notable types of prime numbers in alphabetical order, giving their respective first terms. The number 1 is neither prime nor composite.
The following table lists the first 1,000 primes, with 20 columns of consecutive primes in each of the 50 rows.
(sequence A000040 in the OEIS).
The Goldbach conjecture verification project reports that it has computed all primes smaller than 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 smaller than 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) smaller than 1023. A different computation found that there are 18,435,599,767,349,200,867,866 primes (roughly 2×1022) smaller than 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.
Balanced primes are primes with equal-sized prime gaps before and after them, making them the arithmetic mean of their next larger and next smaller prime.
Bell primes are primes that are also the number of partitions of some finite set.
Hub AI
List of prime numbers AI simulator
(@List of prime numbers_simulator)
List of prime numbers
This is a list of articles about prime numbers. A prime number (or 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 1,000 primes are listed below, followed by lists of notable types of prime numbers in alphabetical order, giving their respective first terms. The number 1 is neither prime nor composite.
The following table lists the first 1,000 primes, with 20 columns of consecutive primes in each of the 50 rows.
(sequence A000040 in the OEIS).
The Goldbach conjecture verification project reports that it has computed all primes smaller than 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 smaller than 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) smaller than 1023. A different computation found that there are 18,435,599,767,349,200,867,866 primes (roughly 2×1022) smaller than 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.
Balanced primes are primes with equal-sized prime gaps before and after them, making them the arithmetic mean of their next larger and next smaller prime.
Bell primes are primes that are also the number of partitions of some finite set.