Googology Wiki
Googology Wiki

View full site to see MathJax equation

View full site to see MathJax equation

2,040 (two thousand forty) is the smallest number n, such that 2n cannot be stored on the TI-89 exact mode, according to Sbiis Saibian.[1] It can be simulated online.[2]

It is also the number of pips in a double-15 domino set.

Properties[]

  • 2040 is abundant.[10]
  • Its prime factorization is 23 × 31 × 51 × 171.


Approximations[]

Notation Lower bound Upper bound
Up-arrow notation 45 ↑ 2
Scientific notation 2.04 x 103 2.041 x 103
Slow-growing hierarchy \(g_{\omega^{\omega}}(4)\) \(g_{\omega^{\omega}}(5)\)
Copy notation 20[2] 21[2]
Chained arrow notation 45 → 2
Bowers' Exploding Array Function/Bird's array notation {45,2}
Fast-growing hierarchy f2(7) f2(8)
Hardy hierarchy Hω(1020) Hω(1020)
Middle-growing hierarchy m(ω,10) m(ω,11)
Hyper-E notation E3.3096
Hyper-E notation (non-10 base) \(E[45]2\)
Hyperfactorial array notation 6! 7!
X-Sequence Hyper-Exponential Notation 45{1}2
Steinhaus-Moser Notation 4[3] 5[3]
PlantStar's Debut Notation [1] [2]
H* function H(0.1) H(0.2)
Bashicu matrix system with respect to version 4 (0)[45] (0)[46]
m(n) map m(1)(4) m(1)(5)
s(n) map \(s(1)(\lambda x . x+1)(1019)\) \(s(1)(\lambda x . x+1)(1020)\)

Sources[]