Why NeRDs_360360?
Why did I choose 10^36036010^k1?
360360 = 2*2*2*3*3*5*7*11*13
For small primes p, 10^((p1)*a)==1 (mod p), and so 10^36036010^k1 is not divisible by p. Consequently, after sieving, there is about 15% of the range left and we expect to find about 3 primes in the provable range k=90090360360.
