So there is always the search for the next “biggest known prime number”. The last result that came out of GIMPS was 274207281−1, with over twenty million digits. Wikipedia also lists the twenty highest known prime numbers, only the four smallest on that list have fewer than three million digits.

For some while now, I have been wondering about the smaller prime numbers we haven’t found. How far up is the list of known primes known to be complete? Since 500 to 1000 digit primes are considered safe for the RSA algorithm, I’d assume that it’s well below that. How far along the number line have we checked that there are no more primes to be found? How fast is this boundary moving forward, currently? Have we, for instance, checked the primality of all numbers below 10100, or are we stuck somewhere south of 1020?

**Answer**

The maximum of such list is **far** smaller than mentioned 500-digits. Due to the prime number theorem π(x)≈x/log(x) so one could estimate that the list of prime numbers up to x would require at the order of x digits to represent.

So by using the sieve of Atkin the complexity is O(x) for both time consumption and memory consumption. And all memory available is small enough to be feasible to traverse. This means that the memory available for storing such a list is what should be the limiting factor.

Basically this boils down to that the largest such list is as large as anybody have place (and need) for.

Now the total global storage is estimated to be at the order of 1021 bytes which means that the upper bound of such a prime number list is there. So there exist no complete list with primenumbers up to more than about twenty digits (and not even that since not all storage is devoted to store prime numbers).

**Attribution***Source : Link , Question Author : Arthur , Answer Author : peterh*