First $n$ digits of Graham's Number

1.3k Views Asked by At

I know using Euler's Totient function, it's easy to find the last $n$ digits of Graham's number (or any large repeating power tower), but is there any known way to find the first $n$ digits of Graham's Number? How about in binary? Or in any base besides a power of 3?