Just looking for the number asked in the question. I have a reason for wanting to know.
I've googled this question and the closest I have come to an answer is this:
"The sieve of Eratosthenes is one of the most efficient ways to find all primes smaller than n when n is smaller than 10 million or so (Ref Wiki)."