14348907
This number is a composite.
Single Curio View: (Seek other curios for this number)
In 1956, Borozdkin stated (in a short note without proof) that n greater than 314348907 is sufficient in Vinogradov's proof of the 3-Primes Problem. Note that 14348907 = 315.
Submitted: 2003-11-26 02:52:10; Last Modified: 2015-02-09 13:43:11.
Printed from the PrimePages <t5k.org> © G. L. Honaker and Chris K. Caldwell