Welcome to the Nth Prime Page! Commas and scientific notation
(e.g. 1.0e12) are allowed.
Here's how it works: Enter a value for n below,
from 1 to 2.623.1015. The server will return the
nth prime number (counting 2 as the first). For example,
entering either 1,000,000,000,000 or 1.0e12 will tell you '
1,000,000,000,000th prime is 29,996,224,275,833.' Depending
on the load of the server and the number you pick, your query may take up
to 10 seconds.
Enter a value for x below, from 1 to
1017. The server will return pi(x), the number
of primes not exceeding x. For example, entering
29,996,224,275,833 will tell you '
There are 1,000,000,000,000 primes
less than or equal to 29,996,224,275,833.'
Click below to get a "random" prime chosen from the
first 1012 primes:
For a description of the algorithm used, click
here. In short: the original text of this page, the programs and
datasets for primes below 3*1012, were provided by Andrew Booker.
The extension to the primes below 1017 used data provided by Andrey
V. Kulsha and programs by Andrew Carr, Chris K. Caldwell and Kim Walisch.