Fibonatetris

The Fibonatetris, coined by SuperJedi224, is equal to the trillionth term of the fibonacci sequence (tetris being a modified form of the SI Tera-, for one trillion), starting with the first one.Naming Large Fibonacci Numbers
It has exactly 208,987,640,250 digits.
Its prime factorization starts with 3 × 512 × 7 × 11 × 41 × 47 × 101 × 127 × 151 × 251 × 401 × 641 × 1087 × 1601 × 2161 × 2207 × 3001 × 3041 × 4001 × 4481 × 9601 × …
==Approximations in other notations==
Notation 	Lower bound 	Upper bound
Scientific notation 	\(4\times10^{208\,987\,640\,249}\) 	\(5\times10^{208\,987\,640\,249}\)
Arrow notation 	\(26\uparrow147\,697\,227\,336\) 	\(416\uparrow79\,793\,888\,139\)
Down-arrow notation 	\(526\downarrow\downarrow5\) 	\(157\downarrow\downarrow6\)
Steinhaus-Moser Notation 	10[3][3] 	11[3][3]
Copy notation 	1[1[12]] 	2[2[12]]
Chained arrow notation 	\(26→147\,697\,227\,336\) 	\(416→79\,793\,888\,139\)
H* function 	H(69H(2)) 	H(70H(2))
Taro's multivariable Ackermann function	A(3,A(3,36)) 	A(3,A(3,37))
Pound-Star Notation 	#*((1))*(36)*3 	#*((1))*(37)*3
BEAF 	{26,147697227336} 	{416,79793888139}
Hyper-E notation 	4E208,987,640,249 	5E208,987,640,249
Bashicu matrix system 	(0)(1)[5] 	(0)(1)[6]
Hyperfactorial array notation 	(13!)! 	(14!)!
Fast-growing hierarchy 	\(f_2(f_2(34))\) 	\(f_2(f_2(35))\)
Hardy hierarchy 	\(H_{\omega^22}(34)\) 	\(H_{\omega^22}(35)\)
Slow-growing hierarchy 	\(g_{\omega^{\omega^{\omega+1}2}}(10)\)	\(g_{\omega^{\omega^{\omega+1}2+\omega^\omega}}(10)\)
==Sources==
==See Also==
Category:Class 3
Category:Odd-abundant numbers
Category:Lower class 3