The xappol is equal to {10,10 (2) 2}, or 10 by 10 array of 10's in BEAF.[1]

The xappol is written out in the multirowed array notation as:

        /10 10 10 10 10 10 10 10 10 10\

      /  10 10 10 10 10 10 10 10 10 10  \

    /    10 10 10 10 10 10 10 10 10 10    \

  /      10 10 10 10 10 10 10 10 10 10      \

/        10 10 10 10 10 10 10 10 10 10        \   

\        10 10 10 10 10 10 10 10 10 10        /    

  \      10 10 10 10 10 10 10 10 10 10      /   

    \    10 10 10 10 10 10 10 10 10 10    /  

      \  10 10 10 10 10 10 10 10 10 10  / 

        \10 10 10 10 10 10 10 10 10 10/

Approximations

Notation Approximation
Bird's array notation \(\{10,10 [3] 2\}\)
Cascading-E notation \(E10\#\text{^}\#\#10\)
Hyperfactorial array notation \(10![1,[1,1,3],1,2]\)
Fast-growing hierarchy \(f_{\omega^{\omega^2}}(10)\)
Hardy hierarchy \(H_{\omega^{\omega^{\omega^2}}}(10)\)
Slow-growing hierarchy \(g_{\vartheta(\Omega^{\Omega\omega})}(10)\)

Trivia

  • The Googology Wiki IRC channel used to have a bot named XappolBot.
  • Jonathan Bowers describes Xappol as “unspeakably huge” on his Infinity Scrapers website. He also writes out Xappol on his website.

Sources

  1. Bowers, JonathanInfinity Scrapers. Retrieved January 2013.

See also

Community content is available under CC-BY-SA unless otherwise noted.