Superior Grand Enormabixul

Superior Grand Enormabixul is equal to ((...((200![200(2)200(2)200,200])![200(2)200(2)200,200])...)![200(2)200(2)200,200])![200(2)200(2)200,200] (with Superior enormabixul parentheses), using Hyperfactorial array notation. The term was coined by Lawrence Hollom.Lawrence Hollom's large numbers site
=== Etymology ===
The name of this number is based on the word "superior" and the number "Grand Enormabixul".
=== Approximations ===
Notation 	Approximation
Bird's array notation 	\(\{200,\{200,2,201[1[1\neg4]200[1\neg4]200,200]2\} \\ ,201[1[1\neg4]200[1\neg4]200,200]2\}\)
Hierarchical Hyper-Nested Array Notation 	\(\{200,\{200,2,201[1[1/3\sim2]200[1/3\sim2]200,200]2\} \\ ,201[1[1/3\sim2]200[1/3\sim2]200,200]2\}\)
BEAF 	\(\{200,\{200,2,201(\{X,\{X,199X^2+199X,1,1,3\}+199X,1,1,2\})2\} \\ ,201(\{X,\{X,199X^2+199X,1,1,3\}+199X,1,1,2\})2\}\)Using particular notation \(\{a,b (A) 2\} = A \&\ a\) with prime b.
Fast-growing hierarchy (using this system of FSes)	\(f_{\varphi(1,0,0,\varphi(2,0,0,\omega199+199)+199)+200}(f_{\varphi(1,0,0,\varphi(2,0,0,\omega199+199)+199)+199}(200))\)
Hardy hierarchy 	\(H_{\varphi(1,0,0,\varphi(2,0,0,\omega199+199)+199)\omega^{200}+\varphi(1,0,0,\varphi(2,0,0,\omega199+199)+199)\omega^{199}}(200)\)
Slow-growing hierarchy 	\(g_{\theta(\varphi(1,0,0,\varphi(2,0,0,\Omega200+199)+199)+200,\vartheta(\varphi(1,0,0,\varphi(2,0,0,\Omega200+199)+199)+199))}(200)\)
=== Sources ===
=== See also ===
Category:Numbers
Category:Numbers by Lawrence Hollom
Category:Factorial numbers
Category:Powers of 200
Category:Bachmann's collapsing level