Log base 2 of large integers

[Ian Kelly]

On Wed, Aug 13, 2014 at 10:18 AM, Chris Angelico <rosuav at gmail.com> wrote:
> On Thu, Aug 14, 2014 at 2:12 AM, Peter Pearson <ppearson at nowhere.invalid> wrote:
>> MK Shen used to hang out on the sci.crypt newsgroup, so we're
>> probably talking "cryptographically large" rather than "engineeringly
>> large".
>
> So "fairly large" means somewhere between googolplex an Graham's
> Number, and after that they'd be called "very large"?

I estimate that representing a googolplex as a 64-bit Python 3 int
would require around 4.429 * 10**75 yottabytes of memory. So probably
not that large.