A number much larger than Graham's can be represented in less than 64 bits [1], using a functional flavored Busy Beaver function [2]. [1] https://googology.fan

A number much larger than Graham's can be represented in less than 64 bits [1], using a functional flavored Busy Beaver function [2]. [1] https://googology.fandom.com/wiki/User_blog:JohnTromp/The_largest_number_representable_in_64_bits https://googology.fandom.com/wiki/User_blog:JohnTromp/The_la... [2] https://oeis.org/A333479 https://oeis.org/A333479