The (observable) universe is fuggin TINY

I asked a math wiz friend how many different ways the various quanta of matter and energy in the universe could be configured and he shrugged and said "something like 10^90 factorial." I mean, that assumes each particle could interact with each other particle only 1 way. But let's assume it's 1,000,000,000 different ways and round the figure to 10^100 factorial. That's called a googolbang and has 995,657,055,180,967,481,723,488,710,810,833,949,177,056,029,941,963,334,338,855,462,168,341,353,507,911,292,252,707,750,506,615,682,568 digits. (That's not the number, just the number of digits in the number.)

I believe this is a fair representation of all possible configurations of all the entropy in the entire observable universe. Every expression of every possibility. It's large, but much closer to zero than to even some of the smaller large numbers, which require their own language and notation to be coherently expressed. Some of them are too large to be contained within all the entropy of the observable universe. And that's just the number of DIGITS in the number.

Conclusion: the observable universe is tiny. Fuggin. Tiny.

Edit: "And that's just the number of DIGITS in the number." is incorrect. The number is the number, but at that scale the number of digits and the actual number are relatively similar, and neither would come anywhere close to fitting within the observable universe.

Oh, and TREE(3) is miniscule as well. Friedman's SSCG function, another finite number, is much, much larger.

(From Wikipedia) In mathematics, a simple subcubic graph (SSCG) is a finite simple graph in which each vertex has a degree of at most three. Suppose we have a sequence of simple subcubic graphs G1, G2, ... such that each graph Gi has at most i + k vertices (for some integer k) and for no i < j is Gi homeomorphically embeddable into (i.e. is a graph minor of) Gj.

The Robertson–Seymour theorem proves that subcubic graphs (simple or not) are well-founded by homeomorphic embeddability, implying such a sequence cannot be infinite. Then, by applying Kőnig's lemma on the tree of such sequences under extension, for each value of k there is a sequence with maximal length. The function SSCG(k) denotes that length for simple subcubic graphs. The function SCG(k) denotes that length for (general) subcubic graphs.

The SCG sequence begins SCG(0) = 6, but then explodes to a value equivalent to fε2*2 in the fast-growing hierarchy.

The SSCG sequence begins slower than SCG, SSCG(0) = 2, SSCG(1) = 5, but then grows rapidly. SSCG(2) = 3 × 2(3 × 295) − 8 ≈ 3.241704 × 1035775080127201286522908640065. Its first and last 20 digits are 32417042291246009846...34057047399148290040. SSCG(3) is much larger than both TREE(3) and TREETREE(3)(3), that is, the TREE function nested TREE(3) times with 3 at the bottom.