The goobolgigaplex is equal to {10, {10, {10, … {10, 100 (1) 2} (1) 2} (1) 2} … (1) 2} (1,000,000,001 times). The term was coined by HaydenTheGoogologist2009.[1]
Approximations[]
| Notation | Approximation |
|---|---|
| Bowers' Exploding Array Function | \(\lbrace10,1000000002,2(1)2\rbrace\) |
| Bird's array notation | \(\lbrace10,1000000002,2[2]2\rbrace\) |
| DeepLineMadom's Array Notation | 10[2{2}2]1,000,000,002 |
| Cascading-E notation | \(E100\#\text{^}\#100\#1,000,000,001\) |
| Hyperfactorial array notation | \(100![1000000001,1,1,2]\) |
| Strong array notation | s(10, 1000000002, 2 {2} 2) |
| Fast-growing hierarchy | \(f_{\omega^{\omega}}^{1,000,000,001}(100)\) |
| Hardy hierarchy | \(H_{\omega^{\omega^{\omega}}1,000,000,001}(100)\) |
Sources[]
- ↑ Hayden's Big Numbers - Goobol series. Retrieved 2022-09-10.