8690333381690951

This number is a prime.

                                                           869033 3381690951

Single Curio View:   (Seek other curios for this number)
Marxen and Buntrock proved in 1997 that the maximal number of steps that a six-state Turing machine can make on an initially blank tape before eventually halting is at least 8690333381690951.

Submitted: 2006-08-23 18:03:27;   Last Modified: 2008-05-23 10:03:44.
Printed from the PrimePages <primes.utm.edu> © G. L. Honaker and Chris K. Caldwell