User blog comment:Vel!/Cited in a book/@comment-3427444-20141023065828

Page 118: "The formula states that the approximate number of primes less than or equal to prime p is the number p divided by the natural logarithm of the number p. [...] [T]here are approximately 6.02284 &times; 1071 primes less than p that you have to test. This is much worse than computing the ground state of thulium. That is, you would have to carry out approximately 600 duovigintillion35 long divisions of primes before you hit the first prime factor p of the composite number c."

Page 128: "35. Yes, this is a real word. A 'duovigintillion' is written as the number 1 followed by 69 zeros. See 'Duovigintillion' in Googology Wiki (Wikia, June 16, 2011), http://googology.wikia.com/wiki/Duovigintillion."