Vigintyllion

10^4,194,304

A vigintyllion is the largest -yllion Knuth mentioned in the article where he

introduced his -yllions (see this page for more about them). It's one followed by
4,194,304 (222) zeros. It's notable because it's only the 20th -yllion, and yet
it's larger than numbers like Henkle's milli-millillion, the largest number named
in his system! See my article on them for how Knuth's system is able to work like
that.

See also decyllion and centyllion.

Fzmillion 
1,000,000^1,000,000 = 10^6,000,000 

This number is a million raised to its own power. It was given by Cockburn himself
as an example of a number nameable with the fz- prefix, in the article where he
introduces the gar-, fz-, and fuga- prefixes. 

8^8^8 
6014520736..........5421126656 with 15,151,336 digits 

8^^3 (eight tetrated to three) or 8^8^8, a number with fifteen million digits.
Storing this number would take up about 100 MB of space, and the value is larger
than a fzmillion but less than a googolbong. Click here for all of its digits.

Largest known prime number (as of 2013-15)

274,207,281-1
~ 5.82*10^17,425,170 

This number (click here for all the digits) is the 48th known Mersenne prime. For
three years it was the record holder of largest known prime number. It was
discovered January 25, 2013 by Curtis Cooper, a prolific contributor to GIMPS (the
Great Internet Mersenne Prime Search). It broke the previous 12-and-a-bit-million
digit record of 2008. The number is gigantic with over seventeen million digits,
making it a small class 3 number.

Largest known prime number (as of 2016)

274,207,281-1
~ 3.00*10^22,338,617

This number (click here for all the digits) is the 49th known Mersenne prime. It's
the current record holder of largest known prime number, the largest number that we
know for sure is prime. It was discovered September 17, 2015 on Curtis Cooper's
computer software, though a bug prevented the email about the new largest known
prime from being sent, so it was not discovered by human beings until the prime-
finding computer was checked for maintenance on January 7, 2016. Although the prime
was found by a computer in September 2015, the discovery date is marked as four
months later because that date was the first time a human discovered the number as
prime.

This record-holding prime has five million more digits than the previous record
holder, meaning that it's not just 5 million times larger than the previous number,
but 105,000,000 times larger. It is known that there are infinitely many prime
numbers, but testing a number to be prime becomes famously difficult as a prime
gets very large - the largest known primes have been Mersenne primes because
Mersenne primes are a lot easier to test for primality than other prime numbers for
primality.
Largest known perfect number (as of 2016)
274,207,281*(274,207,281-1)
~ 4.51*10^44,677,234

When 274,207,281-1 (currently the largest known prime number) was proven to be

prime, it quickly followed that this number was a perfect number. It's the largest
known perfect number, since all even perfect numbers connect to Mersenne primes,
and it is not known if there are any odd perfect numbers (see 496 for more). This
number has 44 million digits, so it's about the square of the largest known prime.

Fuganine
9^9^8
~ 10^41,077,011

This is the ninth member of the fuga- series, a number with about 41 million digits
which falls somewhere between the 2014 record holder for largest known perfect
number and a googolbong.

Googolbong 
10^100,000,000

A googolbong is 1 followed by 100 million zeros. It's a continuation of the

googolgong recently coined by Sbiis Saibian. It's expressible as E100,000,000 or as
E8#2 in Hyper-E notation, and it's the thousandth power of a googolgong and the
millionth power of a googol. Aarex (?) gave this number an alternative name,
googolmine.

Some users of Googology Wiki pointed out that the number's name is a little weird
since "bong" is also the name of a device used to smoke marijuana. Sbiis Saibian
said that he was aware of this, and altough the marijuana device was not the main
point of the name, it matches the number's theme since he says that one would have
to be high to think they are able to understand this enormous number. Besides, as
Sbiis Saibian said, Bowers already beat him with a "bongulus" :)

f3(3)
~ 6.8591*10^121,210,694 

This is a number equal to f3(3) or fw(3) that shows up often when working with
threes in the fast-growing hierarchy. It it a very large number with over 100
million digits that falls between a googolbong and 9^9^9. The number, however, can
still be written out in full - since 9^9^9 has been written in full, this number,
with a third as many digits, can definitely be written out. 

9^9^9 / Ulysses Number

4281247731..........2627177289 with 369,693,110 digits 

9^^3 (nine tetrated to three) or 9^9^9, a 369-million-digit number. You could store
this on a flash drive but it would take up over a gigabyte of space. 

9^9^9 is one of the largest numbers to appear in fiction. It appeared in the novel
"Ulysses" by James Joyce, in this paragraph: 

“Because some years previously in 1886 when occupied with the problem of the
quadrature of the circle he had learned of the existence of a number computed to a
relative degree of accuracy to be of such magnitude and of so many places, e.g. the
9th power of the 9th power of 9, that, the result having been obtained, 33 closely
printed volumes of 1000 pages each of innumerable quires and reams of India paper
would have to be requisitioned in order to contain the complete tale of its printed
integers of units, tens, hundreds, thousands, tens of thousands, hundreds of
thousands, millions, tens of millions, hundreds of millions, billions, the nucleus
of the nebula of every digit of every series containing succinctly the potentiality
of being raised to the utmost kinetic elaboration of any power of any of its
powers” 

"The 9th power of the 9th power of 9" would normally be interpreted as (9^9)^9 =
9^81, which is much smaller, but from describing the large amunt of space that
would be needed to hold its decimal expansion, he was clearly describing the hyper-
exponential number 9^9^9.

There is a website which has the full decimal expansion of 9^9^9 in spirit of this
passage, with the digits stored in 33 webpages with 11 to 12 million digits each. 

This number shows up sometimes in large number discussions, since it's the largest
number you can make with just three digits and mathematical operators. Though three
digits can name more different numbers than four fours, the largest number formable
with three digits is vanishingly small compared to the largest such number for four
fours (see 4^^4).

Billionplex / Fugaten 
10^1,000,000,000 

This is 1 followed by a billion zeros, a number shown here mostly for comparison's

sake. Also, this number can be named "fugaten" with the fuga- prefix.

Googolpleiv 
4^4^16 ~ 10^2,585,897,973

This is another cool googolple- number, about 2.6 billion digits long - certainly
too large to store efficiently on this website, but still small enough to
realistically store. It's equal to 4^4,294,967,296 - the exponent, 4,294,967,296,
also happens to be a member of the googo- series (googoviji). Interesting
coincidence in my opinion. 

Nanillion 
10^3,000,000,003 

The billionth -illion, exactly equal to one followed by three-billion-and-three

zeros. Its decimal expansion is a little longer than that of a googolpleiv. 

Robert Munafo's number of possible human beings 

3.62*10^3,576,838,408 

Robert Munafo mentioned this number on his number list, as his estimate for the
total number of possible combinations for the human genetic code. He calculated
this number from taking 4 (number of DNA bases) to the power of 5,941,000,000
(estimate of the number of bases in a human's DNA). It's a HUGE number with 3.576
billion digits; although not each of these combinations would produce a distinct
human being (due to the majority of DNA being noncoding DNA), but it's so big that,
as Sbiis Saibian said on his large number site: unless you're a member of twins,
triplets, etc, you really don't need to worry about bumping into someone with the
same DNA as you. For more about this and related numbers see here.

Trialogue / School House Rock Number

10^10^10 

A trialogue is a googolism coined by Sbiis Saibian, equal to 10 tetrated to the

third or 1 followed by ten billion zeros. It's also notable because it appears in a
School House Rock song (READ MORE) 

Gartrialogue 
(10^10^10)^2 = 10^20,000,000,000

On Andre Joyce's googology page, this number was formerly listed as a (erroneous)
value for the googolplex. This demonstrates a misunderstanding of exponential laws
- instead of being a googol digits long, this number is a mere 20 billion digits
long. Simply observe:

10^10^10^2 = 10^10^100 = googolplex

(10^10^10)^2 = 10^10^10*10^10^10 = 10^(10^10+10^10) = 10^(2*10^10) ≠ googolplex

Googolthrong 
10^100,000,000,000 

A gogolthrong (coined by Sbiis Saibian) is one followed by a hundred billion zeros.

It's the millionth power of a googolgong or the tenth power of a trialogue. It's
expressible as 10^10^11, or as E11#2 in Hyper-E, and it falls somewhere between a
trialogue squared and Ballium's number.

Ballium's Number
(794,843,294,078,147,843,293.7+1/30)*e^π^e^π 
~ 2.040427*10^138,732,019,349

A number that appears in a joke YouTube video by a channel called Meerkats
Anonymous. 

In the video, a fictional physicist named Samuel Ballium says he was studying
relativistic space theory while his wife was reciting Shakespeare, and because of
his wife reciting Shakespeare he inadvertently added Hamlet to an equation. Ballium
claims that the Hamlet operator caused the equation to return the highest number,
equal to 794 quintillion 843 quadrillion 294 trillion 78 billion 147 million 843
thousand 293 point 7 3 recurring multiplied by e to the power of pi to the power of
e to the power of pi. 

The narrator of the video says that one of the reasons why this number has not yet
been discovered is because it's so "phenomenally big". However, the narrator then
says that most people didn't believe that Ballium's discovery was true, and a
fictional mathematician named Dr. Nilda Christobal Haverman commented that she
refuses to believe that there is actually a largest number, and proclaims that by
adding 1 to the number she's made a larger number. 

But then, Ballium says that Haverman doesn't understand how the Hamlet operator
works, and says that adding 1 to the number he discovered doesn't make it any
higher, because after the number he discovered, numbers just stop growing. The
narrator then interviews a man on the street about his opinion on the number, and
the man on the street has no words. The video ends with the narrator saying that
whether or not the largest number really exists, it will have interesting
ramifications for us all. 

For obvious reasons, there is no largest number and the entire video is complete
bullshit, but hey, jokes are jokes.

Sbiis Saibian gave this number a name, Ballium's Number. But how big is this
"largest number" really? It's about 138 billion digits long and begins 2040427...,
so it falls between a googolthrong and 11^11^11. Although it represents an ordinary
person's idea of a really big number, since it's only 138 billion digits long, that
means it is vastly smaller than a googolplex, so it turns out not to be all that
big. It's not even close to Graham's number, which is itself vanishingly small to
the unspeakable numbers googologists have studied! Therefore, it would be hugely
disappointing to googologists if this was indeed the largest number. 

11^11^11 
10^297,121,486,765 

This is 11 tetrated to the third, a 300-billion-digit number and the first integer
of the form x^x^x to pass Ballium's Number. 

Estimated size of inflationary universe 

10^10^12  

This is a rough estimate of the size of the whole universe in cubic meters based on
inflationary models - not just the observable universe, but the whole entire
universe beyond just what we can observe. It's a notably large number, managing to
surpass the unimaginably huge trialogue. It’s much bigger than
a googol and centillion, and even the googolgong!

Picillion 
10^(3*trillion+3) 

The trillionth -illion, named so by Bowers. It's also the largest number Harry
Foundalis describes as nameable in typical modern Greek on his page on Greek
numerals (see here and here).

3^3^3^3 
10^(3.64*10^12) 

3^^4 or 3^3^3^3. A few trillion digits long! As you can see, in x^^y, y matters
much more than x - in part 3 of this list you’ll see even more incredible examples
of this. 

12^12^12 
10^(9.62*10^12) 

This is 12^12^12 or 12^^3. It's the smallest x^^3 number bigger than 3^^4. It’s
about the cube of 3^^4.

10^20^10 
10^(1.02*10^13) 

Andre Joyce once said on his infamous googology page that googolple-x is x^(2x)^x
when x is written in Roman numerals. This formula is incorrect; it should be
x^x^x^2. When you plug in googolplex to that system, you get a number vastly
smaller than a googolplex, being merely 10 trillion digits long. 

3^(7,625,597,484,987^7,625,597,484,987)
~ 10^(9.823*10^13)

In the entry for Graham's number (which is the last entry) in David G. Wells' book
"The Penguin Dictionary of Curious and Interesting Numbers", he erroneously claimed
that 3^^^3 is equal to this value. The real 3^^^3 is equal to 3^3^3^3 ... ^3,
with 7,625,597,484,987 3's - that's a FAR FAR FAR larger number.

I suspect that Wells made the mistake of 3^^7,625,597,484,987 =

3^(7,625,597,484,987^7,625,597,484,987) based on the fact that 3^^3 = 3^(3^3);
perhaps he incorrectly concluded that since 3^^3 = 3^(3^3), a^^b = a^(b^b).
Googolgandingan 
10^10^14 

A googolgandingan is 1 followed by 100 trillion zeros, a name coined by Sbiis

Saibian. It's yet another number coined on analogy to the googolgong. It's
the trillionth power of a googol, or the millionth power of a googolbong. The name
comes from "gandingan", an instrument consisting of four chimes in a series.

13^13^13 
10^(3.37*10^14) 

13 tetrated to the 3rd. This number has 337 trillion digits! 

Femtillion 
10^(3*quadrillion+3) 

The quadrillionth -illion. 

Linde and Vanchurin's number of distinguishable parallel universes

10^10^16

This is Andrei Linde and Vilaty Vanchurin's estimate on the number of

distinguishable parallel universes, based on an estimate of humans being able to
absorb around 10^16 (ten quadrillion) bits of information in their lifetime. By
applying this estimate, they give this figure as an upper bound for how many
parallel universes a human can distinguish.

14^14^14 
10^(1.27*10^16) 

14 tetrated to the third. This number is about 13 quadrillion digits long, so it

falls between a femtillion and Archimedes' number. 

Archimedes' Number 
108*10^16 

This is 1 followed by 80 quadrillion zeroes. It's the largest number Archimedes

named in The Sand-Reckoner, a book of his (ca. 287-212 BC) which discussed large
numbers and attempted to estimate the number of grains of sand in the universe.

In a section of his book, he named some large numbers. This one was defined as 100
million (known as a myriad myriad in Ancient Greece) to the power of 100 million,
to the power of 100 million, or: 

((100,000,000)100,000,000)100,000,000

The number was the largest number in an extension to the Greek numeral system,
which used Greek letters to name numbers up to 10,000. He extended it to name some
very huge numbers! 

In some sense this is the first example of googology: naming very large numbers
just for largeness's sake. Googology Wiki lists this as the first event in its
large number timeline. This makes Archimedes' work pretty notable in the world of
googology in itself! 

Googolplev 
5^5^25 ~ 10^2.08*10^17 

The fifth member of the googo- series. This one would take up an exabyte of space,
so it's pretty difficult to store its decimal expansion.

Attillion 
10^(3*quintillion+3) 

The quintillionth -illion.

Duquomevalka 
2[2,4] ~ 10^(2*10^21) 

This is another copy notation (see 22) number by SpongeTechX, equal to 222......222

with a dutrimevalka twos. Amongst Bowers' -illions this falls just under
zeptillion. The next number is this many digits long - the du-x-mevalka function is
a good example of tetrational growth. 

Zeptillion 
10^(3*sextillion+3) 

The sextillionth -illion.

Yoctillion 
10^(3*septillion+3) 

The septillionth -illion, and the last of Bowers’ -illions to use a SI prefix. The
next ones are all Bowers' own names. 

20^^3 
10^(1.36*10^26) 

Let’s skip through the numbers of the form x^^3 to this number, equal to 20
tetrated to the third. It has 136 septilliondigits. 

little foot
100000000000000000000000000000000^10000000000000000000000000 = 103.2*10^26

This number is incredibly huge ... it's almost as big as the current largest named
number, BIG FOOT - not!

It was given by a user new to Googology Wiki by the name Vilius2001 as a guess of
how big BIG FOOT might be. The name "little foot" was given by Sbiis Saibian, and
this number is not even bigger than a googolplex, which is itself far smaller
than Graham's number, which is itself much smaller than a tethrathoth which is
itself not even close to as big as the largest known numbers really are! If
anything it represents an ordinary person's idea of an incredibly huge number!

Xonillion 
10^(3*octillion+3) 

The first of Bowers' -illions to use an extended SI prefix. Also the octillionth -
illion. 

Lower bound for SSCG(2)

3*23*2^95-8
~ 103.775*10^28

This is a lower bound for SSCG(2) with the SSCG (Simple Subcubic Graph) function, a
sibling of Harvey Friedman's SCG function (see SCG(13) for details). SSCG(0) is 1,
SSCG(1) is 5, and SSCG(2) is known to be at least this big, a number with 37
octillion digits. SSCG(2) is believed to be the largest output of the SSCG(x)
function that can be expressed with conventional methods, since all larger outputs
require using the fast-growing hierarchy or similar.

Vecillion 
10^(3*nonillion+3) 

The nonillionth -illion.

Centyllion
105,070,602,400,912,917,605,986,812,821,504 ~ 105.071*10^30

In Knuth's -yllion system a centyllion is equal to exactly 10^2^102, a number with

about 5.071 nonillion digits. It's a pretty awesome number in my opinion. If you
were to stack enough sheets of paper to store all the digits of this number
(assuming each sheet can hold 20,000 digits, 10,000 on each side, then the stack
would reach 1.34 million light-years high, which would be about 13 times larger
than the Milky Way galaxy!

See also decyllion, vigintyllion, and centillion.

Mecillion 
10^(3*decillion+3) 

The decillionth -illion. At this point Bowers begins to do something interesting

with his -illion names - he gives a new system of names unlike the SI prefixes. 

Estimated odds of a person living 1000 years or more 

10^10^36 

Some inscurance companies have tables that calculate the odds that a person would
live past a certain age, and after a certain point they give formulas to estimate
the odds of living past even older ages. Robert Munafo used one such formula to
calculate this value, the odds that someone would live 1000 years or more. Even the
number of digits of this number is ridiculously huge now, and we still haven’t
reached a googolplex! 

Duecillion 
10^(3*10^36+3) 

Trecillion 
10^(3*10^39+3) 

e^(1.59*10^40)
~ 10^(6.8952*10^39)

This number is the current upper-bound for the smallest counterexample of

the Mertens conjecture, a conjecture in mathematics which turns out to be
incorrect. The conjecture states that |M(x)| (| | are absolute value bars and M(x)
is the Mertens function) will always be less than the square root of x.

The Mertens function M(x) is defined as the sum of the values of the Mobius
function for integers 1 through x. The Mobius function (denoted with the Greek
letter mu (µ)) is itself defined for positive integer outputs:

µ(x) =:

1 if x is squarefree (is not divisible by any non-trivial square number) and has an

even number of prime factors
-1 if x is squarefree and has an odd number of prime factors factors
0 if x is not squarefree

It has been proven that there exists a number x such that the absolute value of
M(x) is not bounded by the square root of x, but it is not known exactly what the
smallest such x is. The current best upper-bound for the smallest such x is
e1.59*10^40, a number with about 6.89 duodecillion digits.

An interesting fact about the Mertens conjecture is that if it were true, that
would imply that the Riemann hypothesis is also true.

See also Skewes' number, an well-known old upper-bound for a somewhat similar

problem.

Tetrecillion 
10^(3*10^42+3) 

Pentecillion 
10^(3*10^45+3) 

Icosillion 
10^(3*10^60+3)

This number is the point where Bowers begins using Greek roots for numbers in his -
illion names - the next major gear shift. 

Lynz at the time of my birth

10^(63*2^198) ~ 10^10^61.40 

The lynz (pronounced lines) is an ever-growing number which is calculated as

follows: 

On February 26, 1998, it's equal to 100. 

Every day after that, the value doubles, so on 2/27/1998 it's 200, on 2/28/1998
it's 400, on 3/1/1998 it's 800, etc. But that's not the end of the story - on
September 17, 1998 the value is rounded to one vigintillion and squares every day
fro m there on, making it grow much faster - on 9/18/1998, it blew past the googol
and soon after a centillion, quickly reaching the class 3 range of numbers. On
April 3, 1999 (my birth), it was equal to around 10^10^61, approximately an
icosillion in terms of Bowers' illions. 

See also the late 2008 and mid-2014 values of the lynz.

Lower bound for the size of Linde's Grand Universe

10^10^64

There is a theory of chaotic inflation devised by Andrei Linde that states that our
universe is part of a Grand Universe which consists of many universes, with local
Big Bangs constantly going off. Unlike our plain old universe, such a Grand
Universe would inflate eternally with all the local big bangs. Not a lot is known
about how that theory would really work or how large or old the Grand universe is,
but we can come up with a lower-bound for how big the Grand Universe is.

Sbiis Saibian devised such an estimate in his article "Surveying the Cosmos". He
assumed that the size of the Grand Universe multiplies by at least 10^10^12 each
Planck time, and let it run for 13.7 billion years (since that's the age of our
universe, we know the Grand Universe must be AT LEAST this old). There he got
10^10^64 as a lower-bound for the size of the inflationary universe in meters,
light years, or whatever. We can't come up with a reasonably certain upper-bound
for the size though, since we have no way of upper-bounding how old Linde's Grand
Universe might be - we have no reason to believe our local universe we necessary
the first of the universes to have existed!

Triacontillion 
10^(3*10^90+3)

2^10^100
~ 10^10^99.4786

This number is two to the power of a googol. It was once erroneously listed as a
way to express the googolplex by Andre Joyce - he used his g-function, expressing
it as g(2,g(2,100,10),2). This is rather inexplicable, since one a simple
correction gives us googolplex = g(2,g(2,100,10),10).

This number appears to be almost nothing less than the googolplex, but actually you
need to raise it to the fourth power to get it past a googolplex. This tells us
that we're moving through the numbers very quickly far faster than you think! But
hold on, you know what they say, it only gets worse ...

See also log(log(2)).

The Googladigit Range

10^10^100 ~ 10^10^999,999
Entries: 42

Googolplex
10^10^100 

Main article: Googol and Googolplex

A googolplex is a well-known large equal to 1 followed by a googol (10^100) zeros.

For many people, it is the largest number with a name. It's gotten a lot of
attention due to its simple explanation and vast size, and it has been referenced
many times in culture. It is the origin of some notable ideas in googology, mainly
the -plex suffix (most often defined as 10n). However, as far as large numbers go
it really isn't that big!

To get an idea of how big a googolplex really is, consider the difficulty of just
writing it out in full as 10000 ... ... 0000 with a googol zeros. Imagine that
everyone alive today were to write zeros continuously, writing a zero every Planck
time. At that insane way-beyond-superhuman rate you could write about 1043 zeros in
a second! But even at this rate, it would take about
2.38 duodecillion (2.38*1039) years for all of us to write out a googolplex. For
more about a googolplex, read my googol and googolplex article (link above).

Googolplex plus one

10^10^100 + 1

No, this number isn't just here to parody those who add one to the largest number
they know of; it's actually significant as a number outside of that. Why is that?

People have calculated factors of numbers just past a googolplex. That sounds
impossible, but with some clever tricks relating to the modulo function that can be
done without too much difficulty. This number's smallest known factor
is 31,691,265,005,705,730,374,175,801,344,000,001, or 31.7 decillion. 

Googolplex plus thirty-seven 

10^10^100 + 37 
This is the smallest number after a googolplex with no known factors.

Gooprolplex
~ 10^(10^100 + 267)

This is a googolism defined in the inactive blog "A googol is a tiny dot" defined
as the smallest prime larger than 10gooprol (gooprol = 10^100+267 is the smallest
prime number larger than a googol). It's quite trivial to see that this number must
lie somewhere between 10^(10^100+267) and 10^(10^100+268) (closer to the former)
based on what is known about the distribution of primes. And yet, it's not possible
with currently known methods to find exactly how big this number is, more
specifically how much larger it is than 10^(10^100+267), and therefore the number
doesn't have an article on Googology Wiki. Nonetheless this is still a completely
well-defined number.

50^100^50 
10^(1.70*10^100) 

The result of plugging "googolplel" into Joyce's verbatim googolple- system. It's

the closest the system gets to a googolplex. This value falls just between the
cracks of a googolplex and a gargoogolplex. 

Googolplel could logically be interpreted as this if we forget the whole googolple-

system and instead use the -ple- infix: x-ple-y is y^x where y is written in Roman
numerals. So googolplel in this case would be 50^googol since L is Roman numerals
for 50. However, that wouldn't be as interesting in my opinion.

Gargoogolplex 
(10^10^100)^2 = 10^(2*10^100) 

This number is the square of a googolplex. Its name has an interesting story. The

children of a man named Allstair Cockburn played a game where the goal was to name
a number larger than the previous person's number by saying "My space commander
rules x stars". It would usually end at a million until Allstair introduced his
kids to the googol and googolplex. Then, Allstair's youngest son Kieran said "My
space commander rules a gargoogolplex stars", and said that a gargoogolplex was a
googolplex googolplexes. That was the origin of the gar- prefix, and the
inspiration for its more powerful brothers fz-, fuga-, and megafuga-.

Even though a googolplex googolplexes sounds impressive, wiith numbers this big
this isn’t a good extension. This is 1 followed by only twice as many zeros as a
googolplex, less than even 10^10^101. Therefore, not a great attempt at extending a
googolplex. 

Googolillion
10^(3*10^100+3)

This is one followed by three-googol-and-three zeros, a humorous number which is

just an -illionized version of the googol. It's a thousand times the cube of
a googolplex.

10^10^101 

This number looks a tad bigger than a googolplex, but in reality this is raising
the googolplex to the 10th power. Don’t believe me? Simply observe: 

(10^10^100)^10 = 10^(10^100*10) = 10^(10^100*10^1) = 10^(10^(100+1)) = 10^10^101 

With numbers this big, looks can be deceiving, but this is a relatively tame
example of that kind of thing! 

Also, this number is a lower bound to the googolbang. 

Googolbang
(10^100)!

A googolbang is the factorial of a googol. The number that came from the website
"Cantor's Attic", a wiki that focuses mostly on infinite numbers. It is betwen
10^10^101 and 10^10^102, and it’s only “a little bigger” than a googolplex if by "a
little bigger" you mean that you need to raise a googolplex to the 100th power to
get a number bigger than a googolbang. It has about 9.96*10^101 digits, so
logarithmically it’s closer to 10^10^102 than to 10^10^101. It starts
162940433246.... and has exactly 2.5*10^99-18 trailing zeros and its last nonzero
digit is 6. A lot of the information on the number has been found using methods to
estimate large factorials.

Fzgoogol 
(10^100)^(10^100) = 10^10^102 

Fz- is a prefix related to the gar- prefix that takes a number to the power of

itself. With numbers this big, it still is pretty powerful. Here’s why it’s
10^10^102: 

(10^100)^(10^100) = 10^(100*10^100) = 10^(10^100*10^2) = 10^10^102. 

This number is also an upper-bound for a googolbang.

Tetracontillion 
10^(3*10^120+3) 

The first of Bowers' milestone -illions to transcend a googolplex. 

Pentacontillion 
10^(3*10^150+3)

Tritet Jr. / Megafuga-four / Booga-four

4^^4 ~ 10^(8.0723*10^153)
This is a large number equal to 4^4^4^4, 4^^4 (four tetrated to four), or 4^^^2
(four pentated to two). It's a tiny pentational number but a mid-sized tetrational
number, and it has several different names. It's named "megafugafour" using the
megafuga- prefix which tetrates a number  to itself, or booga-four with the booga-
prefix which turns a number n into n^n-2n (see here for more on these prefixes).
Jonathan Bowers used to call this number "tritet" because it was at the time equal
to {4,4,4} in his array notation ({4,4,4} now equals the much larger 4^^^^4
instead), so Sbiis Saibian calls this number Tritet Jr. 

A Tritet Jr. or whatever you want to call it is a number on roughly the same scale
as a googolplex. It's my favorite example of a class 3 number which we can't write
out but can approximate pretty well, with both the number of digits and starting
digits. It’s amazing that both the leading and ending digits can be computed quite
easily, but that since the number of digits is so large we will never compute all
of them. For more on this sort of stuff, see 10^1,000,000.

Here is how this number starts and ends: 

23610226714597313206............36860456095261392896 

It's exactly
8072304726028225379382630397085399030071367921738743031867082828418414481568309 
149198911814701229483451981557574771156496457238535299087481244990261351117 digits
long. 

4^^4 is the highest solution to the four fours puzzle, where your goal is to name
as many numbers as you can with four fours and standard mathematical operators. For
example, 9 can be expressed as 4+4+4/4, and 172 can be expressed as 4*44 - 4. 4^^4
can be expressed as 4^(4^(4^4)). It's interesting that people usually think of
forming smallish numbers with this puzzle, but in fact it can form a number that is
bigger than a googolplex! 

81^^3 
~10^(7.3786*10^154)

The smallest x^^3 number greater than Tritet Jr. 

Hexacontillion 
10^(3*10^180+3) 

Fugahundred 
(....(((100^100)^100)^100).....)^100) with 100 100’s = 100^100^99 = 10^(2*10^198)

A fugahundred is formed by applying the fuga- prefix which takes n and turns it
into (...(((n^n)^n)^n ... )^n with n copies of n, which is equal to n^n^(n-1). It
is larger than a googolplex, and in fact it's the 2*1098th power of a googolplex.

Gargoogol-plexed
10^10^200

This is a nonstandard way to interpret "gargoogolplex", applying "-plex" to

"gargoogol" instead of "gar-" to "googolplex". It's the googolth power of a
googolplex, meaning that it's a googolplex googolplex googolplex ... ... ...
googolplexes (say a googol times).

Heptacontillion 
10^(3*10^210+3) 

Octacontillion 
10^(3*10^240+3) 

Ennacontillion 
10^(3*10^270+3) 

Hectillion 
10^(3*10^300+3) 

Notable for being a little less (in hyper-exponential terms) than an ecetonplex.

Ecetonplex / Centillionillion
10^10^303 or E303#2 

This is a googolism created by Sbiis Saibian as a "plexed" version of the

centillion - it's one followed by a centillion zeros. He names it "ecetonplex"
rather than the awkward "centillionplex". Sbiis Saibian called this number
“centillionillion” as a kid after "learning" about the googolgong - it's the only
number he named as a kid, and he believes that it's the first large number he ever
devised. However, despite the name "centillionillion", this is not the centillionth
-illion, so the name is erroneous (see next entry).
Centillionillion (corrected version) 
10^(3*10^303+3) 

This number is the centillionth -illion, and "centilionillion" is a silly name that

can be logically used for this number. It's called a henhectillion in Bowers'
illion system. It's a thousand times the cube of the previous number. 

Promaxima 
10^10^343 

The promaxima is Sbiis Saibian's alternate universe count. It is the most recent
revision of a calculation he posted on the infamous "Really Big Numbers" forum,
where he calculated the number of possible histories of the universe from its birth
to its death, assuming that sub-Planck units aren’t meaningful. He ended up with
this crazy number, notable for being bigger than a googolplex. Promaxima means
probability maximum, meaning that Sbiis Saibian considers it the largest number
probability can meaningfully generate. Although there are larger numbers
probability can give us, it's debatable whether they are physically meaninful.
See this article for more.

Now literally anything you can think of, even if it’s ridiculous, is part of one of
these histories. You were born a Planck time later? Whole new history.You were born
two Planck times later? New history. You were born a Planck time earlier? Another
new history. You never actually read this list? Another new history. This text is
in a different color? Yet another new history. You sneeze as you’re reading this?
Another history. Even crazy things like the universe being created by your favorite
celebrity or your pet cat turning into a mutant alien for one yoctosecond are among
those histories.

Kilofaxul 
(200!)! 

About 10^10^379, the factorial of a faxul. If we listed every way 200 books could
be arranged, those arrangements could be arranged a kilofaxul ways. We could
arrange those arrangements of arrangements, but that becomes meaningless quickly. 

Dohectillion 
10^(3*10^600+3)

Trihectillion 
10^(3*10^900+3)

Great googolplex / googolplexichime 

10^10^1000 

Along with the great googol, Joyce defines the great googolplex. Saibian calls this
number googolplexichime with the -chime suffix similar to the -gong suffix. It's
equal to 1 followed by a googolchime zeros.

Lynz at the time Googology Wiki was founded

10^(63*2^3732) ~ 10^10^1125 

Googology Wiki was founded on December 5, 2008; at that time, the lynz (for the
definition, see the entry "Lynz at the time of my birth") recently passed a great
googolplex. In terms of Bowers' -illions, it was between a trihectillion and a
tetrahectillion. 

Tetrahectillion 
10^(3*10^1200+3)
Pentahectillion 
10^(3*10^1500+3) 

Lynz at the time this website was created

10^(63*2^5732)
~ 10^10^1727 

This website was founded May 28, 2014 - at that time the lynz (see here for more
about it) was equal to about 10^10^1727, between a pentahectillion and a
hexahectillion. It's gradually drifting away from this value, and eventually will
pass 10^10^2000. 

Hexahectillion 
10^(3*10^1800+3)

Heptahectillion 
10^(3*10^2100+3)

5^5^5^5 
5^^4, ~10^10^2184

Five tetrated to four, a moderately sized tetrational number. This number has
somewhere between a googolchime and a millillion digits.

Octahectillion 
10^(3*10^2400+3)

Ennahectillion
10^(3*10^2700+3)

Killillion 
10^(3*10^3000+3)

Another milestone in Bowers' -illions - this is where he starts using the large SI
prefixes. It's the last of his -illions I'm listing here.

Great great googolplex / googolplexitoll 

10^10^10,000

Sbiis Saibian calls this number googolplexitoll, analogizing "googolplex" with

"googolitoll". 

6^6^6^6 
6^^4, ~10^10^36,305 

These numbers are growing horrendously fast - this one has a 36,000-digit number of
digits.

Googolplexigong 
10^10^100,000 

This is the combination of googolplex with the -gong suffix. It sounds better than

googolgongplex. 

7^7^7^7 
7^^4, ~10^10^695,974 

This number is 7 tetrated to the fourth - there are nearly a million digits in the
number of digits in this number.

Now that we're done with these little babies, how about some bigger numbers?
Welcome to part 3 of this list. 
PART 3: THE FRIENDLY PRELIMINARIES
10^10^1,000,000 ~ fw(n) numbers
This part starts with a millionduplex, ascends past a googolduplex and other
tetrational numbers, and quickly reaches bigger unfamiliar numbers. As big as they
are, all these numbers are small enough to represent or approximate with most of
popular large number notations: exponents, tetration, the Ackermann function, up-
arrow notation, and the beginning of Conway chain arrows.
The Fourth-Class Range
10^10^1,000,000 ~ 10^10^10^1,000,000
Entries: 35
 
Millionduplex
10^10^1,000,000
The boundary between class 3 and 4 numbers. Class 4 numbers range from
10^10^1,000,000 (E6#3) to 10^10^10^1,000,000 (E6#4) - they can't be approximated
accurately, but their number of digits can be. They are numbers when 2*n can no
longer really be distinguished from n, and begin a stage where the numbers begin to
mess with your mind (see Skewes' Approxima for instance). Both of Skewes' numbers
and a googolduplex are examples of class 4 numbers.
In my opinion, class 4 numbers are a major turning point in large numbers: they
transcend approximations that can be considered accurate in ordinary terms, and
also are a good near-transcension of the real world. After all, even the small
class 4 numbers transcend a promaxima, which can be argued to be the largest
meaningful number probability-wise.
Fzmilliplexion
(10^1,000,000)^(10^1,000,000) = 10^10^1,000,006
This is a number Sbiis Saibian's brother came up with in an attempt to show that
naming large numbers is always easy. Sbiis Saibian himself gave this number a name,
fzmilliplexion, from the fz- prefix which takes a number to the power of itself and
milliplexion, a name he gives for ten to the millionth power.
This number is equal to the millionth power of a millionduplex, but it turns out
that at this scale that isn't much of an improvement. Hold on now, how can that be
right?! Just observe:
(10^1,000,000)^(10^1,000,000)
= 10^(1,000,000*10^1,000,000) - we're just using the exponential laws taught in
algebra here!
= 10^(10^6*10^1,000,000)
= 10^(10^(1,000,000+6))
= 10^10^1,000,006
It's all about the counterintuitivity of hyper-exponential functions - you need to
throw away your usual number sense because it's really misleading with numbers this
big, and bring out a googology sense. However this is a very tame example compared
to the even bigger giants!
Number of ways to arrange the books in the Library of Babel
~ 10^10^1,834,103
This is an example of a number "way out there" that we can generate using the realm
of probability, but is debatable whether it's "phyiscally meaningful". It's the
number of ways to arrange the books in the Library of Babel, a fictional library
consisting of every possible book with 410 pages, 3200 characters per page, and 25
different possible characters (the number of books in it is known as Borges'
number, see that entry for more on the Library of Babel). By taking the factorial
of Borges' number, we get the number of ways to arrange the books in that library.
There are 1.83 million digits in the number of digits in this number.
8^8^8^8
8^^4, ~10^10^15,151,335
This is 8 tetrated to the fourth, a number with a 15-million-digit number of
digits.
10^10^33,014,740
A commonly cited erroneous value of the number of books to arrange the Library of
Babel, from the book "The Unimaginable Mathematics of the Library of Babel".
Googolplexibong
10^10^100,000,000
Can be written as E8#3 in Hyper-E notation. The value is much larger than 8^^4 but
much less than 9^^4.
9^9^9^9
9^^4, ~10^10^369,693,099
This is 9 tetrated to the fourth or 9^9^9^9. Like its cousin 9^9^9, this number has
shown up a lot in large number discussions, being the largest number you can name
with 4 digits and standard mathematical operators. Scott Aaronson mentioned this
number several times in his essay "Who Can Name the Bigger Number" as an example of
how easy it is to name very large numbers.
Tetralogue
10^^4 = 10^10^10^10
This number is equal to one followed by a trialogue zeros, a.k.a. one followed by
"one followed by ten billion zeros" zeros. These numbers are getting close to
numbers that can’t represent anything in the real world. But this is still less
than numbers like Poincare recurrence times.
This is the fourth member of the -logue series, one followed by "one followed by
ten billion zeros" zeros, an unfathomable sized number.
Googolplexithrong
10^10^10^11
Can be written E11#3 in Hyper-E. The number is between a tetralogue and Skewes'
Number.
3^3^3^3^3
~ 10^10^(3.638*10^12)
This is three tetrated to the fifth. It's notable for being the smallest power
tower of threes bigger than a googolplex, and it's commonly compared to the much
larger tritri, equal to 3 pentated to 3, a.k.a. a power tower of 7.6 trillion
threes. There are 3.6 trillion digits in the number of digits in this number.

Hollom's odds that all parallel universes are the same

~10^10^10^16

In the second part of Lawrence Hollom's website, he discusses large numbers that
occur in probability such as the monkey-typewriter number and other similar bigger
numbers. He finishes off with what he claims is the largest number that can
represent anything in the real world:

Hollom says that with a promaxima, the number of possible different parallel
universes assuming sub-Planck units aren't meaningful, and the number of parallel
universes out there, we can calculate the odds that all those universes are the
same. He gives 10^10^16 as an estimate of the number of parallel universes in the
multiverse (although that is actually an estimate of the number of distinguishable
parallel universes), and then takes the old value of the promaxima (10^10^245) to
the power of 10^10^16, and calculates that to be approximately 10^10^10^17, even
though it's really about 10^10^10^16.

Though this number may be the largest number that can represent real-world things
probability-wise, Hollom clearly hadn't heard of Poincare recurrence times.
f3(4)
~ 10^10^10^20.5506
This is a HUGE number equal to f3(4) in thee fast-growing hierarchy. This monstrous
number falls between a googolplexithrong and Skewes' number, making it a good
tetrational number. However, it's a very tame example of what the fast-growing
hierarchy has to offer! f3(x) achieves tetrational growth, but f4(x) crushes that
with pentational growth!
Skewes’ Number
e^e^e^79
~ 10^10^(8.85214*10^33)
Main article: Skewes' numbers
Skewes' number is one of the "classic" large numbers, along with the googol and
googolplex, Graham's number, the Steinhaus-Moser notation numbers, and some others.
It was defined by Stanley Skewes in a 1933 mathematical proof, as an upper-bound
for the first point where the prime counting function (noted π(x), the number of
prime numbers below x) crosses the logarithmic integral function (noted li(x),
defined as the integral:
    x
    /\
    |
    |  1/ln(t) dt
    |
   \/
    0
assuming the Riemann hypothesis to be true. The number falls between a tetralogue
and a googolduplex, and at one time it was the largest number used in a
mathematical proof before the second Skewes' number came along - the larger second
Skewes' number was proven as an upper-bound without assuming the Riemann hypothesis
about 20 years later.
Since Skewes' time the upper-bound for the problem has been improved significantly
- the current upper-bound is 1.39*10^316, still a sizable number and reasonably
close to a centillion. The current lower bound is 10^14 (100 trillion). But
nonetheless, due to its surprising size (see my article on Skewes' numbers for a
detailed coverage of how big it is) it remains a famous large number. Skewes'
number is probably the fourth most famous googolism, after the googol and
googolplex (tied for first) and Graham's number (third).
Skewes’ Approxima
10^10^10^34
Sbiis Saibian explained this way better than I could, so I will quote him on his
ultimate large number list:
          This is an approximation usually given for Skewes' Number, since Skewes'
Number is about 10^10^10^33.947. This might seem like a good approximation, but
this value is actually A LOT LARGER THAN Skewes' Number. How much larger? You'd
have to raise Skewes' Number to the power of about 10^10^33 to get 10^10^10^34!
           Here's a way to get an idea of what that means. Imagine that you had a
sphere containing roughly a Skewes' Number particles. That sphere would be massive,
even assuming the particles were tightly packed. Now imagine that sphere being just
one amongst a Skewes' Number of such spheres! Imagine all these spheres are
contained in A 2nd order "Skewes' sphere". Now imagine that is only one amongst a
Skewes' Number of 2nd order Skewes' spheres all contained in a 3rd order Skewes'
sphere!! Now keep scaling up to the 4th order, 5th, 6th, 7th, 8th, 9th, 10th, ...
100th, 1000th, millionth, billionth, trillionth, ... centillionth, ... ... ... ...
and keep on going until you reach the 10^10^33 order sphere. That sphere will
contain roughly 10^10^10^34 particles! Mind boggling! And this is only the
difference between 10^10^10^33.947 and 10^10^10^34, and we're still only talking
about moderately sized tetrational numbers!!!
In other words, looks are REALLY deceiving with numbers this big ... but you know
what they say: it only gets worse!
Poincare Recurrence Time (low)
10^10^10^76
There is a theory that states that the universe will return to its previous state
after a long but finite time. This is that length of time for a black hole of
stellar mass. Poincare recurrence times are the largest numbers to have occurred in
any science!
Googolyllion
10^(2^10^100+2)
~ 10^10^10^99.4786
This is the -yllionized version of a googol, or the googolth -yllion, since the xth
-yllion is equal to 10^(2^n+2) (see 100,000,000). It's an amusing number analogous
to the googolillion. It's "slightly" smaller than a googolduplex.
Googolduplex
10^10^10^100
A googolduplex is 1 followed by a googolplex zeros. It's also known as a
googolplexplex or a googolplexian (or erroneously as a gargoogolplex which is
actually the square of a googolplex). However, among the googology community there
is general consensus that this number should be called a "googolduplex", mostly
because its name is systematic and -duplex is a contraction of -plexplex and
literally means "two plex". However, although I highly prefer googolduplex I have
also seen supporters of the name "googolplexian" over "googolduplex" in the
googology community.

A googolduplex was probably originally created as a response to the googolplex, and

has been further extended to a googoltriplex, quadriplex, quintiplex, etc, using
Latin roots. A googolduplex is at a stage where the numbers are difficult to
compare to real world values - that is typical of class 4 numbers (see
10^10^1,000,000).
This number can be written E100#3 or E2#4 in Hyper-E notation. It's a lower bound
to a googolplex-bang since 10^x is a lower bound for x! when x is at least 25.
A googolduplex would take a number of letters on the scale of a googol to write out
in terms of any -illions (i.e. it's hopelessly impossible), but here's how it would
start and end in terms of Bowers' -illions:
ten tretractratriotriacontetriotriahecto...............................
...............................tretrigintitrecentimilli-duotrigintitrecentillion
It's pretty hard to try to start representing a googolduplex in terms of Bowers'
intricate -illion system, and the number has a very intricate name for one, using
hundreds of different roots.
In Conway and Guy's system, the name is far more mundane though:
ten
trillitrestrigintitrecentillitrestrigintitrecentillitrestrigintitrecentilli........
................
.....................trestrigintitrecentillitrestrigintitrecentillitrestrigintitrec
entilliduotrigintitrecentillion
where trestrigintitrecentilli is repeated about a third of a googol times. The name
there has exactly eight-googol-and-one letters.
(pointless fact: the guy who made this website is a fairly vehement googolplexian
hater which is pretty cool)
Googolplex-bang
(10^10^100)!
The factorial of a googolplex. This is “slightly” larger than than the googolduplex
and “slightly” smaller than taking a googolplex to its own power.
Fzgoogolplex
(10^10^100)^(10^10^100)
This is a googolplex to the power of a googolplex, a classic example of a layman's
attempt to name the biggest number they can. Tim Urban mentioned this number on his
blog post "From 1,000,000 to Graham's Number", saying that before he learned about
Graham's number he thought that numbers like a googolplex to the googolplexth power
were the biggest numbers a human could conceive of. As it turns out this number
does NOT EVEN COME CLOSE to Graham's number, although Graham's number is itself
NOWHERE CLOSE to the largest numbers a human could conceive of.
This number evaluates to:
(10^10^100)^(10^10^100) = 10^(10^100*10^10^100) = 10^10^(10^100+100).
That last form looks only a tad bigger than a googolduplex, but it's actually equal
to raising it to the googolth power! This means that if you were to start with a
googolduplex, and dwarf it by a factor of itself every Planck time (that means you
would dwarf it by a factor of itself 1043 times every second!), it would take an
unimaginably long 1.706*1049 years to get a fzgoogolplex!!
10^10^10^101
A lower bound for googolbang-plex, googoldubang, and fugagoogol.
Googolbang-plex
10^((10^100)!)
Between 10^10^10^101 and 10^10^10^102. It is of note that even though x-bang is
more powerful than x-plex, banging the googolplex is less powerful than plexing the
googolbang.
Googolbangbang / googoldubang
((10^100)!)!
A number I made up as the factorial of the googol-bang; on the logarithmic level
it’s indistinguishable from the googolbang-plex. Googolbangbang is the obvious
name, but googoldubang sounds much nicer, just like googolplexplex vs.
googolplexian vs. googolduplex.
Fugagoogol
Googol vv Googol
Each v is a down arrow. Down-arrow notation is like up-arrow notation, but
evaluated from left to right instead of right to left; therefore it is less
powerful. If you don’t get it here’s a quick definition:
x v y = x^y
x vv y = ((x v x) v x)....v x)...)) with y x’s
x vvv y = ((x vv x) vv x)....vv x)...)) with y x’s
etc.
This number is about 10^10^10^102, exactly 10^10^(10^102-98). It looks slightly
larger than a googolduplex, but the looks are deceiving - the number of digits is
actually about a googolplex, raised to the 100th power! (for more on this number
look here)
10^10^10^102
An upper-bound on googolbang-plex, googoldubang, and fugagoogol. You can see that
there are various functions that can be used to create numbers in the neighborhood
of a googolduplex.
Poincaré Recurrence Time (mid)
10^10^10^120
This is the value of a Poincaré recurrence time for a black hole with mass of the
observable universe.
Cosmological inflationary size of the universe
10^10^10^122
If the universe were to expand as much as it did when it was born, it would be this
big. That’s over a googolduplex! This number is so large that it makes no
difference whether we use Planck lengths or yottameters.
Ecetonduplex
10^10^10^303
Continuing the centillion the same way we are continuing the googol.
Megafaxul
((200!)!)!
The factorial of a kilofaxul. This is about 10^10^10^379. Then we can have a
gigafaxul, a terafaxul, a petafaxul, and an exafaxul.
2nd Skewes’ Number
e^e^e^e^7.705
~ 10^10^10^963.5185
Main article: Skewes' numbers
This number was proven by Stanley Skewes in 1955 to be an upper-bound to the first
crossing point of the prime counting function and the logarithmic integral
function, but unlike the original Skewes' number, this bound did not assume the
Riemann hypothesis (see my article on Skewes' numbers) to be true. It is bigger
than a googolduplex and it held the honor for largest number in a mathematical
proof for about 20 years until it was dethroned by Graham's number (actually Little
Graham).
Googolduplexichime
10^10^10^1000
Or E1000#3. Also a common upper-bound for 2nd Skewes’ Number.
Megafuga-five
5^^5
Roughly 10^10^10^10^2184, or E2184#4. A good tetrational number but a tiny
pentational number.
Googolduplexitoll
10^10^10^10,000
This is equal to ten to the power of ten to the power of a googol to the hundredth
power. It falls a little under gagfour.

Gagfour
A(4,4) = 2^^7-3
~ 10^10^10^19,728
A(3,3) wiith the Ackermann function isn't super-impressive at 61, but increase both
arguments by one in the function and the value explodes! A(4,4), with the Ackermann
function formulas in the entry for 61, can be expressed in up-arrow notation as
2^^7-3 = 22^2^65,536-3 - the vallue falls between 5^^5 and a googolduplexigong. The
number is a hugely unfathomable number that passes a googolduplex, and is on the
high end of the class 4 range. But gagfive will make this look tiny!
10^(3*10^(3*10^21,000))
Thomas Jones, on his large numbers site, devise a system to name hypercubes of
large numbers of dimensions. This number appears to be the limit of the system
(note that it can name over a googolduplex dimensions!). A hypercube of this many
dimensions, in Jones' system, is called an unyoctillectilletteract.
Googolduplexigong
10^10^10^100,000
Continuing Sbiis Saibian’s primitive googol series.

The Hyperclass Range

10^10^10^1,000,000 ~ 10^^10
Entries: 28
Milliontriplex
10^10^10^1,000,000
The boundary between class 4 and class 5 numbers - class 5 numbers range from
10^10^10^1,000,000 to 10^10^10^10^1,000,000. A googoltriplex is an example of a
class 5 number.
Class 5 numbers are at a stage where x^2 is indistinguishable from x. To get an
idea of what that means, imagine a sphere containing a googoltriplex spheres, and
then imagine a second sphere made of a googoltriplex of those spheres! Amazingly,
the number of particles in the first sphere wouldn't be distinguishable from the
number of particles in the second! It's all about the counter-intuition here that
really boggles the mind.
Pentalogue
10^10^10^10^10 = 10^^5
Or 10^10^10^10^10, fifth member of the -logue series. This number is almost too big
to represent anything in science at all.

Poincare Recurrence Time (high)

10^10^10^10^13
This is the Poincare recurrence time for a black hole with the mass of the entire
universe assuming a certain inflation theory. It's notable because it's arguably
the largest number that has any kind of real-world meaning. I say "arguably"
because it's uncertain how meaningful this figure really is (it may well be just
something hypothetical). For details read this article.
Nonetheless this is a truly huge number, far far bigger than anything we can
comprehend. After this point there's no number that is known to even arguably
represent anything in the real world that can compare to the numbers that lie ahead
...
Googoltriplex
10^10^10^10^100
One followed by a googolduplex zeros is usually known as a googoltriplex
(pronounced /goo-gol-try-plex/). I've also seen it referred to as
"googolplexianite" on analogy to "googolplexian", or "gargantugoogolplex" on
analogy to the erroneous "gargoogolplex" for 1 followed by a googolplex zeros.
A googoltriplex is the first member of the googol series (googol, googolplex,
googolduplex ... ) that cannot be expressed in terms of Bowers' illions.
Fugagoogolplex
(10^10^100) vv (10^10^100) in down-arrow notation
~ 10^10^10^(10^100+100)
This is an awesome number. It looks only somewhat larger than a googoltriplex, but
the number of digits in this number is really the number of digits in a
googolduplex RAISED TO THE GOOGOLTH POWER! For more see my article on googological
prefixes and suffixes.

17^10^(3*10^(3*10^21,000))
The seventeenth unyoctillectilletteract (see 10^(3*10^(3*10^21,000)) )
Pentafact
5* = 6561^^5
~ E25,043#4
A pentafact is the SpongeTechX mixed factorial of 5, equal to (((1+2)*3)^4)^^5 (see
also 6561). It is a very large number that falls between a googoltriplexitoll and
6^^6.
Megafuga-six
6^^6 ~ E36,305#4
This is the superfactorial of three; the superfactorial of x is equal to
(x!)^^(x!). The function achieves super-tetrational growth rates.
Millionquadriplex
E6#5 = 10^10^10^10^1,000,000
The boundary between class 5 and class 6 numbers. Class 6 numbers are at a scale
where x^log(x) is indistinguishable from than x. For example, imagine a
googolquadriplex times a googolquadriplex times a googolquadriplex times a
googolquadriplex ... ... ... times a googolquadriplex times a googolquadriplex,
where googolquadriplex is said a googoltriplex times. That number is not computably
diffrerent from a googolquadriplex itself!
Mind-boggling much? Well, hold on to your seats, because soon we'll blast to
numbers that transcend any such analogy!
10^10^10^10^18,705,353
A lower bound for BB(7) found by Wythagoras and Cloudy176 of Googology Wiki, which
is on the low end of the class 6 range. It's much larger than a millionquadriplex
but vanishingly smaller than a hexalogue.
Hexalogue
10^10^10^10^10^10 = 10^^6
The sixth member of the -logue series.
Joycian Tetratri
g(3,3,3,3)
A number I defined with Joyce’s g function. It’s approximately E14#5, placing it
between a hexalogue and a googolquadriplex. It can be written in up-arrow notation
as ((3^^3)^^3)^^3. The g-function has very strange behavior, seen in one of my
articles.
Googolquadriplex
E100#5
A googolquadriplex is one followed by a googoltriplex zeros. It's sometimes
referred to as googolquadraplex.
Megafuga-seven
7^^7, ~E695,974#5
Falls between a googolquadriplexigong (not listed) and a millionquintiplex.

Millionquintiplex
E6#6
The boundary between class 6 and class 7 numbers.
Heptalogue
10^^7
Googolquintiplex
E100#6
One followed by a googolquadriplex zeros is called a googolquintiplex, also called
googolquinplex.
Millionsextiplex
E6#7
The boundary between class 7 and class 8 numbers.
Megafuga-eight
8^^8, ~E7#7
Octalogue
10^^8
Googolsextiplex
E100#7
Millionseptiplex
E6#8
The boundary between class 8 and class 9 numbers.
Megafuga-nine
9^^9, ~E9#9
Ennalogue
10^^9
Bentley's Number
10^^9 + 10^^8 + 10^^7 + 10^^6 + 10^^5 + 10^^4 + 10^10^10 + 10^10 + 10 + 1
Bentley's Number is a number based on the story "Forever Endeavor" written by
Jonathan Bowers (the name comes from the blog "A googol is a tiny dot"). The story
is about an ordinary man named Jack Bentley who takes an opportunity to earn a
million dollars by building ten "counters", but the task turns out to be an
extremely bad idea, taking virtually eternities upon eternities to finish - the
first counter has 1 wheel, the second 10 wheels, the third 10^10 wheels, the fourth
10^10^10 wheels, all the way up to 10^^9 wheels on the last one, and each is used
to count the number of wheels on the previous. Bentley's Number is the total number
of wheels the main character, named Bentley, has to place on all the counters, and
it is the sum of the numbers of the form 10^^n from n = 0 to 9.
Googolseptiplex
E100#8
Millionoctiplex
E6#9
The boundary between class 9 and class 10 numbers. At this point the idea of
classes is nearing its breaking point in that it's starting not to become so useful
for categorizing numbers.
Tetraplo ekatommyriaplekatomyriakis ekatommyrio
f(g(f(g(f(g(f(6,000,000))))))) where f(x) = 103x+3 and g(x) = 106x
~ E6,000,000#8

This is a ridiculously huge number that has an interesting story:

A man named Harry Foundalis, on his website, has a page that talks about numbers in
modern Greek, up to the ridiculously huge 1 followed by three-trillion-and-three
zeros (called "picillion" by Jonathan Bowers). He then gives a link to another page
which is in Greek about how to name numbers that are truly dizzyingly gigantic,
making Bowers' illions look adorable.
The system is basically a Greek version of the -illions, which start off like so
(phonetically transliterated from the Greek alphabet to the Latin alphabet):
million = ekatommyrio
billion = disekatommyrio
trillion = trisekatommyrio
quadrillion = tetrakis ekatommyrio
quintillion = pentakis ekatommyrio
sextillion = exakis ekatommyrio
septillion = eptakis ekatommyrio
The names can be thought of as meaning "million", "second million", "third
million", etc, since they match with the Greek number roots (e.g. tetra- means 4).

Foundalis decides to stretch this system to outrageous heights. The largest number
he names with exponent notation is:
6,000,000
3*10 +3
6*10
3*10 +3
6*10
3*10 +3
6*10
3*10 +3
10

O_o;;
That monstrous number is named "tetraplo ekatomyriaplekatomyriakis ekatommyria".
However it's not the largest number he names! (see ekatommyriaplo
ekatommyriaplekatommyriakis ekatommyriaplo ekatommyriaplekatommyriakis
ekatommyriaplo ekatommyriaplekatommyriakis ekatommyrio, later)
The Tetronomical Range
10^^10 ~ 10^^10^100
Entries: 52

Decker / dekalogue / megafuga-ten

10^^10
This is a personal favorite large number of mine. It’s
10^10^10^10^10^10^10^10^10^10 in full, a power tower of ten tens or ten tetrated to
the hundredth. The term dekalogue is from Sbiis Saibian; the term decker is from
Bowers. It’s 10^^10 or 10^^^2 in up-arrow notation (a good tetrational number but a
tiny pentational number), and E1#10 in Hyper-E.

I like this number mainly because it feels like a transition between the smaller
numbers and the bigger numbers. The smaller numbers, in my imagination, represent
things on Earth. The bigger numbers, however, represent mysterious godly things.
This was originally the boundary between part 1 and part 2, but since part 1 was
getting too big, I had to change the boundary to a millionduplex, then to a googol,
then to a million.

By the way, the name "tetronomical" for this range comes from the word
"tetronomical" coined by Sbiis Saibian as a portmanteau of "tetration" +
"astronomical". Basically exponentiation is to astronomical numbers what tetration
is to tetronomical numbers.
Googoloctiplex
E100#9
A lower bound to the major googolplex and to Genu's Number.
Major googolplex
(10^10^100)^^8
Used in the definition of Genu's Number.
Genu's Number
((1010^100)^^8)((10^3003)^(10^3003)+10^100)+(1010^10^10^10^100)10^6000^10^273
This number was coined in a deleted Googology Wiki blog post by someone who goes by
the name Commando Conceptor L5 5.12.159.141 on Googology Wiki. He wrote it as:
major
googolplexmillillion^millillion+googol+googolquadriplex10^6000^nonagintillion.
The creator of this number says that it is the health of the
B.L.O.O.N.S.T.O.W.E.R.D.E.F.E.N.S.E.9.W.I.K.I., a fanmade Bloons Tower Defense
boss. However, Genu's number is really just a salad number - all the operations
performed on the major googolplex have little effect on its size, and it ends up
barely any larger than a major googolplex.
E101#9
An upper bound to Genu's number more accurate than E109#9. For proof that it's less
than E101#9 click here.
E109#9
On the page where Genu's Number is introduced to Googology Wiki, Sbiis Saibian
proved in a comment that E109#9 is a generous upper bound to Genu's Number. He
single-handedly showed that this number is vastly smaller than a googolnoniplex, or
E100#10.

Googolnoniplex
E100#10
A very weak upper bound to Genu's number.

Googoldeciplex
E100#11

The 10th -plex of a googol.

Icosalogue
10^^20
Megafuga-twenty-four
24^^24 ~ E33#23
The superfactorial of four, a power tower of 24 24's. It can also be written as
24^^^2.

Penantalogue
10^^50

Giggol / hectalogue
10^^100

A giggol is defined by Jonathan Bowers as equal to ten tetrated to the hundredth,

equal to 10^10^10^10^ ... ^10 with 100 tens (a power tower of 100 tens). Written
out as a power tower it's:

It's a number very analogous to the googol, and it's the first of Bowers' googol
extensions. It's one of Bowers' smallest googolisms (can be expressed using array
notation as {10,100,2}, since a^..(n ^s)..^b = {a,b,n}), and it was formerly the
largest number on Robert Munafo's number list (his current largest listed number is
Steinhaus's mega, though he discusses much larger numbers on the large numbers
section of his website). Sbiis Saibian has named this number a "hectalogue" from
the Greek prefix hecta- meaning 100.

Saibian has coined a “similarly sized” number called a grangol, or E100#100. We’ll
see it when we get there, but I want to throw in numbers in between to emphasize
the two numbers’ real difference, like Saibian did in his number list.

Giggol raised to the hundredth

(10^^100)^100

A grangol is 10^10^10^10^10^.........10^100 with 100 10’s. It looks like giggol

raised to the hundredth but is really a lot larger. Remember the Skewes’ spheres?
This number is an impressive-sounding 100th-order giggol sphere, but really not
much of an improvement, and much less than a grangol. We’re moving a lot faster.

Coogol
10^100 in hypermathematics

This is an unusual googolism, equal to 10^100 in hypermathematics. It was coined in

the blog "A googol is a tiny dot".
Hypermathematics is like normal mathematics, except addition is different: for
example, 5+6 = 56, and 30+546 = 30,546. Here’s a visual representation of the
coogol:

10 -> 1010...1010 -> 101010.......101010 -> 101010.......101010 -> ... ... ... ....
-> 101010.......101010

with 100 stages, where the number of 10s in each stage is the number of the
previous stage. This number is between E19#99 and E20#99 in Hyper-E, the former of
which is 10^10^ ... ^10^19 with 99 10's and the latter of which is 10^10^ ...
^10^19 with 99 10's. The lower bound is easier to see since you can imagine a
coogol as:
stage 1 = 10
stage 2 (10101010101010101010) > 10^19 (20 digits long)
stage 3 (1010101.......010 with stage 2 10's) (2*stage 2 digits long) > 10^stage 2
= 10^10^19 = E19#2
stage 4 (1010101.......010 with stage 3 10's) (2*stage 3 digits long) > 10^stage 3
= 10^10^19 = E19#2
stage 5, with this pattern, ~ E19#4

stage 6 ~ E19#5
........
coogol = stage 100 ~ E19#99, placing it between giggol and megafuga-hundred, still
well under grangol.

Megafuga-hundred
100^^100

This number is greater than a giggol but not 10^^101, let alone a grangol. It’s
between E200#99 and E201#99.

10^^101

This number is what we get when we do 1 followed by a giggol zeroes. As you can see
1 followed by x zeroes is getting obsolete with numbers this large - this value is
still under a grangol.

Giggolbang
(10^^100)!

With numbers this big, x! is between 10^x and x^x; therefore this number falls just
within the cracks of 10^^101 and fzgiggol.
Fzgiggol
(10^^100)^(10^^100)

Remember the 100th-order giggol sphere? This is a giggolth-order giggol sphere! As

incredible as this sounds, it’s STILL less than a grangol! Even if you try raising
THAT to the giggolth power, it still doesn't get us far at all, not even past a
grangol.
E11#100
An upper bound to a fzgiggol.
f3(100)
~ E32#100
This is another example of a number definable in the fast-growing hierarchy. It's a
mind-blowingly large number far larger than any number to appear in even the most
exotic realms of science! The value is larger than a giggol but falls short of a
grangol.

Grangol
E100#100

A grangol is one of Sbiis Saibian's smallest googolisms, analogous to the googol

and comparable to the giggol (although it's larger than raising a giggol to its own
power). It is also equal to 10^10^10 ... ... ... ^10^100 with 100 tens, a power
tower of 100 10s topped off with 100. Sbiis Saibian said that it is
The grangol can be thought of as googol-99-plex. It also be written in Andre
Joyce's g-function as g(101,1,2,2,10).

10^^102

The smallest power tower of 10s more than a grangol.

Fugagiggol
(10^^100) vv (10^^100)

This can also be expressed as (10^^100)^(10^^100)^(10^^100-1). It's barely smaller

than the next number, a giggol tetrated to the third, but also by necessity larger
than the previous number. Here's why:
(10^^100)^(10^^100)^(10^^100-1)
> 10^(10^^100)^(10^^100-1)
= 10^(10^(10^^99*(10^^100-1)))
> 10^(10^(10^^100))
= 10^(10^^101)
= 10^^102

(10^^100)^^3

This is a giggol tetrated to the third. It is bigger than a grangol, but not that
much (at least in terms of power tower height of course). In fact, it’s only the
10th power of a fugagiggol, trivial compared to even the difference between a
giggol and grangol.

Googolcentiplex/grangolplex
E100#101

With Saibian’s numbers, -plex means 10 to the power of a number. This number is
used to demonstrate the inadequacy of the -plex suffix on numbers this big; it
makes the power tower of 10s only one level high. This is why Sbiis Saibian invents
the suffix -dex which has a much bigger effect on the number, and for bigger
numbers gives up on a suffix system and uses the word "grand" (grand godgahlah,
grand tethrathoth).
This is the same value as a googolcentiplex, googol’s 100th -plex, and the two
numbers happen to be the same value. Because of that, grangolplex/googolcentiplex
is an example of what defines a googolism - I think in general googolism really
refers more to a name for a number than a number for a name. Therefore grangolplex
and googolcentiplex are probably two different googolisms, and in fact they have
two separate articles on Googology Wiki, which further reflects this. Fore more on
what defines a googolism see my entry for 21 in part 1 of this list.

10^^103
An upper bound to a grangolplex.
10^^198
A power tower of 10's used as a lower bound to the expofaxul.
E5#198

A more accurate lower bound to an expofaxul.

E183,230#197
A very accurate lower bound to an expofaxul.

Expofaxul
200!1

Another Hollomism, defined with the first part of hyperfactorial array notation.
Basically:

x!y = x{y}(x-1){y}(x-2){y}........3{y}2{y}1. Remember that it’s evaluated from

right to left and that a{c}b is a^^^...^^^b with c ^s.

So, this is 200^199^198^197.......^5^4^3^2^1. The power tower is approximately

twice as large as that of a giggol. The value falls between 10^^198 and 10^^199.
E183,231#197
A very accurate upper bound to an expofaxul.
E6#198
A moderately accurate lower bound to an expofaxul.
10^^199
A power tower of 10's used as an upper bound to an expofaxul.
10^^200
This number is notable because it looks like giggol^giggol when written as a power
tower, but is in fact much larger. It's also a rough upper bound to an expofaxul.

10^^257

A power tower of tens commonly used as a lower bound for Steinhaus's mega.

E619#256

A more accurate lower-bound for the mega. It's one of the easiest 10-based bounds
to prove, and written as a power tower it looks like:
10^10^10^ ... ... ^10^10^619 w/256 10s
See my article on Steinhaus-Moser notation for a proof of this bound.

Steinhaus's Mega
2[5] in Steinhaus-Moser notation
~ E619.3#256

Main article: Steinhaus-Moser Notation

x[3] is x in a triangle, or x^x.
x[4] is x in a square, or [...[[[x in a triangle] in a triangle] in a triangle] ...
... in a triangle] with x triangles.
x[5] is x in a pentagon, or [...[[[x in a square] in a square] in a square] ... ...
in a square] with x squares.

and so on. That’s Steinhaus-Moser notation, a notation devised by mathematician

Hugo Steinhaus and extended by Leo Moser as an example of how easy it is to name
very large numbers - see the link above for details on how the notation came to be.
The mega was coined by Steinhaus along with the megiston in his book Mathematical
Snapshots, while the Moser was coined by Leo Moser (it is unknown where it was
first defined).
The mega is one of the “classic” large numbers together with the googol and
googolplex, Skewes’ number, the infamous "world's largest number" Graham’s number,
and (among others) the megiston and Moser. The last two of those are also defined
with Steinhaus-Moser notation.

The mega, or 2 in a pentagon, is already a very large number as you can see, which
is equal to 2 in a pentagon, which solves to:
pentagon(2)
= square(square(2))
= square(triangle(triangle(2))
= square(triangle(22))
= square(triangle(4))
= square(44)
= square(256)
=
triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(tr
iangle(triangle(triangle(triangle(triangle(
triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(tr
iangle(triangle(triangle(triangle(triangle(
triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(tr
iangle(triangle(triangle(triangle(triangle(
triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(tr
iangle(triangle(triangle(triangle(triangle(
triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(tr
iangle(triangle(triangle(triangle(triangle(
triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(tr
iangle(triangle(triangle(triangle(triangle(
triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(tr
iangle(triangle(triangle(triangle(triangle(
triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(tr
iangle(triangle(triangle(triangle(triangle(
triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(tr
iangle(triangle(triangle(triangle(triangle(
triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(tr
iangle(triangle(triangle(triangle(triangle(
triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(tr
iangle(triangle(triangle(triangle(triangle(
triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(tr
iangle(triangle(triangle(triangle(triangle(
triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(tr
iangle(triangle(triangle(triangle(triangle(
triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(tr
iangle(triangle(triangle(triangle(triangle(
triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(tr
iangle(triangle(triangle(triangle(triangle(
triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(tr
iangle(triangle(triangle(triangle(triangle(
triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(tr
iangle(triangle(triangle(triangle(triangle(
triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(tr
iangle(triangle(triangle(triangle(triangle(
triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(triangle(tr
iangle(triangle(triangle(triangle(triangle(
triangle(triangle(triangle(triangle(triangle(triangle(256))))))))))))))))))))))))))
)))))))))))))))))))))))))))))))))))))))))))))
)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))
)))))))))))))))))))))))))))))))))))))))))))))))))
))))))))))))))))))))))))))))))))))))) (there are 256 triangles)
We can also denote this triangle256(256), where triangle(n) is n in a triangle and
the exponent on the function indicates how many times you apply the triangle
function to 256. It's amazing just how big such a simple number is, and yet it
isn't too hard to estimate how big it really is (see my article on Steinhaus-Moser
notation for how you can estimate it). But it pales in comparison to the megiston,
defined as 10 in a pentagon!

This is also the largest number on Robert Munafo's number list - he says that it is
the last one because soon after this number, numbers become hard to express in any
form at all. However, he discusses much larger numbers in the large numbers section
of his website.

E620#256

A more accurate upper-bound on the mega. It's a little harder to prove than
E874#256 but still pretty easy. Written out as a power tower it looks like:
10^10^10^ ... ... ^10^10^620 w/256 10s
E874#256
Another upper bound to Steinhaus's mega that is a little easier to prove than
E620#256. Written out as a power tower it looks like:
10^10^10^ ... ... ^10^10^874 w/256 10s

10^^258

A power tower of tens used as an upper-bound on the mega.

256^^512
This is a fairly naive upper-bound on Steinhaus's mega, which can be derived using
Sbiis Saibian's Knuth Arrow Theorem. Since by the Knuth Arrow Theorem (a^^b)^^c <
a^^(b+c) and the mega = triangle256(256) and triangle(n) = n^n = n^^2, we can see
that:

triangle(256) = 256^^2
triangle2(256) = triangle(triangle(256)) = (256^^2)^^2 < 256^^4
triangle3(256) = triangle(triangle2(256)) < triangle(256^^4) = (256^^4)^^2 < 256^^6
triangle4(256) = triangle(triangle3(256)) < triangle(256^^6) = (256^^6)^^2 < 256^^8
...
triangle256(256) = triangle(triangle255(256)) < triangle(256^^510) = (256^^510)^^2
< 256^^512

As it turns out this is  a much weaker upper-bound than you might think. It's about
E619#511 (a power tower of 511 tens topped off with 619), in comparison to the mega
which is about E619#256 (a power tower of 256 tens topped off with a 619) - the
power tower representing this upper-bound is about twice as tall as the power tower
that represents the mega.

10^^514

A pwer tower of 10's that itself upper-bounds the bound 256^^512 for the mega. This
bound can be shown since:
256^^512 < 10,000,000,000^^512 = (10^^2)^^512 < 10^^(2+512) = 10^^514

Chilialogue
10^^1000

This is a power tower of 1000 tens. It's a new member of Saibian's -logue family -
it comes from Greek "chilias" meaning a thousand.

Grangolchime
E1000#1000

A power tower of 1,000 tens topped with 1,000.

Myrialogue / Joycian gaggol

10^^10,000

A power tower of 10,000 tens. The name comes from Greek "myria" meaning ten
thousand.

This number is also equal to Andre Joyce’s (former) mistaken definition of the
gaggol. The real gaggol is equal to 10^^^100 = 10^^10^^10^^10......^^10 with 100
10s, which is unfathomably larger. The weird thing there is the Joyce's g function
can represent the correct value of a gaggol as g(4,100,10).

Grangoltoll
E10,000#10,000

A power tower of 10,000 tens topped off with 10,000.

Two pentated to four / Two hexated to three

2^^^4 / 2^^^^3
~ E19,729#65,532

This is a cool number which can be expressed in several different ways using
Knuth's up-arrow notation. Let’s start by simplifying the number from the form
2^^^^3:

2^^^^3
= 2^^^2^^^2
= 2^^^2^^2
= 2^^^2^2
= 2^^^4
= 2^^2^^2^^2
= 2^^2^^2^2
= 2^^2^^4
= 2^^2^2^2^2
= 2^^2^2^4
= 2^^2^16
= 2^^65,536
= 2^2^2^2^2.........^2^2 with 65,536 2s

So it can be expressed with hexation as 2^^^^3, pentation as 2^^^4, tetration as

2^^65,536, and exponentiation as 2^2^2^2^2.........^2^2 with 65,536 2s. So it’s a
very very small hexational number, a small pentational number, but a large
tetrational number. Amongst Sbiis Saibian's googolisms it falls between a
grangoltoll and a giggolgong. For more on numbers like this read my article on
Knuth's up-arrows.
Giggolgong
10^^100,000
This is a googolism coined by Sbiis Saibian by combining the -gong suffix with
Bowers' giggol. It's a power tower of 100,000 tens, a thousand times taller than
the tower used to represent a giggol.
Grangolgong
E100,000#100,000

A power tower of 100,000 tens topped with a 100,000. The -gong suffix regularly
appears in Saibian’s smaller numbers.
Megafuga-million
1,000,000^^1,000,000
This number serves as an example of just how many numbers can be named with the
megafuga- prefix. It's a power tower of a million millions.

Joycian gygol
10^^10,000,000

Andre Joyce also attempted to define the Bowerian gigol (at the time called gygol).
The real gigol is equal to 10^^^^^100, which makes the Joycian gygol look tiny.
Joyce’s g function can represent the gigol as g(6,100,10). How did he not know
that?
Octadialogue
10^^100,000,000
An ocatadialogue is defined by Sbiis Saibian as equal to ten tetrated to the one-
hundred-millionth, a.k.a. a power tower of 100 million tens.
Grangolbong
E100,000,000#100,000,000
A power tower of 100 million tense topped off with 100,000,000. It's called
grangolmine by Aarex.

Output of pete-9.c 
~ 2^^386,201,107
pete-9.c was an entry in Bignum Bakeoff by the guy named Pete - it was supposed to
improve on pete-8.c, which was already a lot WORSE than his other programs, but
ended up making a number that was a tiny bit smaller (see next entry). Its only
difference from pete-8.c was that it used 99 in one part instead of 999.

Bignum Bakeoff entries:

< pete-3 | pete-9 | pete-8 >

Output of pete-8.c 
~ 2^^386,201,107
pete-8.c was an entry in Bignum Bakeoff by the guy named Pete, which was meant to
improve the quite powerful pete-7.c. However, a bug caused the program to be far
weaker, making a number that's FAR FAR SMALLER than the output of pete-7.c.

Bignum Bakeoff entries:

< pete-9 | pete-8 | harper >

Joycian gagol
10^^1,000,000,000

Joyce attempted to define the Bowerian gagol as well. The real gagol is equal to
10^^^^^^^100 (that’s 7 ^s). In Joyce’s g function, the gagol is equal to
g(8,100,10).
Perl Hypercalc limit
10^^10^10
This number is approximately the limit of the Perl version of Robert Munafo's
Hypercalc, an awesome calculator program useful for computing numbers up to the
tetronomical level (which is where we are right now). This limit is ABSURDLY larger
than most calculators' limits, often 10^100 or 10^1000.
Grangolthrong
E100,000,000,000#100,000,000,000

A power tower of 100 billion tens topped off with 100,000,000,000.

Tritri
3^^^3
This staggering number, name coined by Bowers, is called tritri because it’s
{3,3,3} (3 threes) in array notation. Here’s how it’s evaluated:
3^^^3
3^^3^^3
3^^3^3^3
3^^3^27
3^^7,625,597,484,987
3^3^3^3........^3 with 7,625,597,484,987 3’s, an unfathomable sized number.
The best way to get an idea of how big tritri is is by considering the power-tower
of threes: imagine the power-tower of those 7 trillion threes reached from Earth to
the sun - each three would be about 2 centimeters in size. Then, the topmost five
threes would already form a number undescribably larger than a googolplex, and
that's only the top 10 centimeters of the tower - imagine how big the whole number
must be if we can't comprehend the tip of the tower!!!

This is one of only two Bowersisms Joyce gets right when he defines them - the
other is the tridecal.
Tritri is notable as part of a moral thought experiment in the group blog
LessWrong: "Would you prefer that one person be horribly tortured for fifty years
without hope or rest, or that 3^^^3 people get dust specks in their eyes?" Of
course, many thinking of the question may get lost in trying to contemplate
tritri's size - it's a nice way to boggle the shit out of your mind, and bring home
its size (or more, bring home how you CAN'T bring home its size). In my opinion,
it's a good example of an unfathomable number, largely since it's pretty easy to
explain. It's one of my favorite numbers larger than a googolplex.

Sedeniadalogue
10^^(10^16)
A sedeniadalogue is defined by Sbiis Saibian as equal to a power of ten quadrillion
tens. That means that it is far larger than tritri but EASILY beaten by the googol-
stack or even the guppylogue.
Guppylogue
10^^(10^20)
Sbiis Saibian continues the -logue idea by appending some of his own googolisms
with the -logue suffix; this number and the following few numbers nicely fill the
gap between a sedeniadialogue and a googol-stack.
Minnowlogue
10^^(10^25)

Gobylogue
10^^(10^35)
Gogologue
10^^(10^50)
256^^(2^256)
~ 10^^(1.16*10^77)
This is a very weak upper-bound on the mega. It is can be shown by considering:
triangle(256) = 256^256
triangle2(256) = (256^256)^(256^256)
triangle3(256) = ((256^256)^(256^256))^((256^256)^(256^256))
triangle4(256) =
(((256^256)^(256^256))^((256^256)^(256^256)))^(((256^256)^(256^256))^((256^256)^(25
6^256)))
etc.
Since the expression for triangle(256) has 2 256's, the expression for
triangle2(256) has 4 256's and is less than 256^256^256^256 = 256^^4,
triangle3(256) has 8 256's and is less than 256^^8, etc, we can continue this to
get triangle256(256) < 256^^(2^256) ~ 10^^(1.16*10^77).
Even this upper-bound is vastly smaller than the megiston, which is 10 in a
pentagon in contrast with mega which is just 2 in a pentagon. It doesn't even make
it to the size of a googol-stack since the power tower of 10's representing a
googol-stack is about 100 sextillion times taller than the tower representing this
number.
Ogologue
10^^(10^80)

The Hyper-Tetronomical Range

10^^10^100 ~ 10^^10^^100
Entries: 25

Googol-stack / Googologue / Googolgoogolplex

10^^(10^100)

This is a power tower of a googol tens, or ten tetrated to a googol. It comes from
the Cantor's Attic suffix -stack which turns n into 10^^n.
Sbiis Saibian calls this number "googologue" using his -logue suffix. Additionally
the Big Psi web book on large numbers calls this a "googolgoogolplex".

Googoldex
E100#1#2

Here’s how the -dex suffix works: If x = Ea#b#c, then x-dex = Ea#b#(c+1). A googol
can be written as E100#1#1, so this is a googoldex.

E100#1#2 = E100#(E100#1#1) = E100#(E100) = E100#googol. So this is a power tower of

10s a googol terms high topped off with a 10. It falls between googol-stack and
megafugagoogol.

Megafugagoogol
(10^100)^^(10^100)

A megafugagoogol is a number equal to a power tower of a googol googols, an example

of a number nameable with the megafuga- prefix. It is only slightly larger than the
googoldex - to see why consider this:
(10^100)^^(10^100) > E(10^100)#(10^100-1), a power-tower of a googol-minus-one tens
topped off with a googol, which is equal to E100#(10^100) = googoldex
See also megafugagoogolplex.

Ecetondex
E303#1#2

Extending the centillion like the googol. This is a power tower of a centillion
10s, topped off with a 303, and an example of the kind of number Sbiis Saibian came
up with as a kid.
Limit of Javascript Hypercalc
10^^(1.7976*10308)
The Javascript version of Hypercalc is even more wide-ranged than the Perl version,
maxing out at a number around the level of a power tower of 1.7976*10308 tens. That
makes it technically wide-ranged enough to store numbers like tritri or a
googoldex! However, the Perl version has advantages of being fully programmable and
additional features.
Googoldexigong
E100,000#1#2
Just for the hell of it, here's the "gong" version of the googoldex - a power tower
of a googolgong 10s, topped off with a 100,000.

Zootzootplex
googolplex!1

This number is googolplex^(googolplex-1)^(googolplex-2).....^5^4^3^2^1, and was

coined by some guy named Andrew Schilling at the age of four (according to a
source, he seems to be about a year older than me). It's equal to the expofactorial
of a googolplex. Schilling also made up two humorous zillion-like names: sillion is
"zillion, but used in sillier contexts", and sillyillion is "like sillion but much
larger, like millillion or milli-millillion".
Since the zootzootplex is a power of a googolplex it’s a huge power of 10. With
Hypercalc we find that when x≥6, x expofactorial is about E(183,230.683)#(x-4).
Therefore this number is comparable to a power tower of a googolplex minus 4 tens
topped with a 183,230, and therefore it's upper-bounded by that power tower topped
off with 10,000,000,000, a.k.a. 10^^(googolplex-2) or a power tower of a googolplex
minus 2 tens.
Zootzootplex, with these calculations, therefore can be estimated to fall under
both googolplex-stack and googolplexidex.

Googolplex-stack
10^^(10^10^100)

You can combine number suffixes to create more complicated googolisms, such as this
number, a power tower of a googolplex tens. This number is also a lower bound for
the googolplexidex.

Googolplexidex
E100#2#2

A power tower of a googolplex 10s topped off with a 100.

Upside-down zootzootplex
2^3^4^5^6^.......^(googolplex-2)^(googolplex-1)^googolplex
The webpage where the zootzootplex came from says that the zootzootplex would be
larger if it were flipped on its head - that is, the power tower is reversed
(starting with a 2 so that it doesn't degenerate into 1). The number is comparable
to and just barely bigger than a power tower of a googolplex tens topped off with a
100, making it just barely bigger than a googolplexidex.
Googolplexidexiplex
E100#(10^10^100+1)
This is an example of a number that can be named by combining googological affixes:
in this case, using plex, then dex, then plex again. It's equal to a power tower of
a googolplex plus one tens topped with a 100. It's also a lower bound for the
megafugagoogolplex.
E(100+10^100)#(10^10^100)
This number is a relatively tight lower bound for the megafugagoogolplex, proven by
Sbiis Saibian.
Megafugagoogolplex
(10^10^100)^^(10^10^100)
This number is a power tower of a googolplex googolplexes, nameable with the
megafuga- prefix. It's an insanely huge number, though that's mostly because of the
height of the power tower, not as much because every number in the tower is a
googolplex. It is an example of a large number a non-googologist might come up
with, often to try to trump Graham's number (it doesn't even come close!). To see
why we'll use Sbiis Saibian's Knuth Arrow Theorem, which states that for a≥2, b≥1,
c≥1, x≥2, (a^xb)^xc < a^x(b+c):
(10^10^100)^^(10^10^100)
< (10^10^10^10)^^(10^10^100)
= (10^^4)^^(10^10^100)
< 10^^(4+10^10^100)
< 27^^(4+10^10^100)
= (3^^2)^^(4+10^10^100)
< 3^^(6+10^10^100)
< 3^^(10^10^101)
< 3^^(10^10^10^10)
= 3^^(10^^4)
< 3^^(27^^4)
< 3^^((3^^2)^^4)
< 3^^(3^^6)
< 3^^3^^3^^3
= 3^^^4
<< 3^^^3^^^3
= 3^^^^3 = G1
<<< G64 = Graham's number
Sbiis Saibian proved that megafugagoogolplex is between E(100+10^100)#(10^10^100)
and E(101+10^100)#(10^10^100), and therefore it falls between a googolplexidexiplex
and a googolplexidexiduplex.
E(101+10^100)#(10^10^100)
Sbiis Saibian proved this number to be a relatively strong upper bound to the
megafugagoogolplex.
Googolplexidexiduplex
E100#(10^10^100+2)
A power tower of a googolplex plus 2 tens topped off with a 100. This number is a
weaker upper bound to the megafugagoogolplex.

Output of harper.c 
~ 2^^(2^2^100,000,002), about 10^^(10^10^30,102,999)
This number is the output of harper.c, Russell Harper's entry in Bignum Bakeoff.
His program performs iterated exponentiation to produce a very large tetrational
number - a number comparable to a power tower of about 10^10^30,000,000 twos that
falls somewhere between a googolplexidex and a googolduplexidex. David Moews, the
man who held Bignum Bakeoff, comments that Harper's program was inefficiently
written; he showed that the program can be rewritten to produce the same number,
but only use half as many characters.

Googolduplexidex
E100#3#2
A power tower of a googolduplex tens topped off with 100.

Googolplex-bang-stack
10^^((10^10^100)!)

This number is a power tower of 10s about a googolduplex terms high, so it’s about
E100#3#2. It’s a bit more than a googolduplexidex.

Googolbang-plex-stack
10^^(10^((10^100)!))
The largest number formable by combining the googol with one each of -bang, -plex,
and -stack.

Googoltriplexidex
E100#4#2

A power tower of a googoltriplex tens topped off with 100.

Megafugagargantugoogolplex
(10^10^10^10^100)^^(10^10^10^10^100)

A megafugagargantugoogolplex is a googoltriplex tetrated to a googoltriplex. Its

name comes from "megafuga-" plus "gargantugooogolplex", an alternate name for a
googoltriplex coined on analogy to the erroneous "gargoogolplex" for 1 followed by
a googolplex zeroes (it's actually a googolplex squared). It's the largest number
listed on a few online large number lists, and therefore it's sometimes touted as
an incredibly huge number; I think this is also partly because its name has an
appeal of sounding really long and mighty, prepending the googolplex with a bunch
of catchy-sounding roots. One random user on Googology Wiki erroneously claimed it
to be the largest named number (it obviously isn't).

Joycian pentatri
g(3,3,3,3,3)

Another number I defined with Joyce’s g function. It’s approximately E14#5#2,

placing it between a googoltriplexidex and a googolquadriplexidex.

Googolquadriplexidex
E100#5#2

Tria-taxis / deckerplex
10^^^3

A power tower of 10s a decker tens high. X-taxis (term by Saibian, formerly -
teraksys) is 10^^^x. I have seen this number called "deckerplex" based on Bowers'
name "decker" for 10^^10.
The Pentation Range
10^^10^^100 ~ 10^^^(10^100)
Entries: 39

Giggolplex
10^^10^^100
Unlike Saibian, Bowers allows -plex to perform any type of recursion. This number
is a power tower of a giggol 10s, and is the first recursive step after a giggol.
Grangoldex
E100#100#2
This number is a power tower of 10s a grangol terms high, topped off with a 100.
It's comparable to giggolplex.
Kiloexpofaxul
expofaxul!1
The exponential factorial of an expofaxul, or expofaxul^expofaxul-1....^4*3*2*1. It
should be obvious what a megaexpofaxul, gigaexpofaxul, etc. are.
Grangoldexigong
E100,000#100,000#2
Yet another -gong number; this is a power tower of a grangolgong 10's topped with a
100,000.
Triton / Grand Mega
3[5] in Steinhaus-Moser Notation
A triton or grand mega is 3 in a circle or pentagon in Steinhaus-Moser Notation.
The first name was coined by Sbiis Saibian (source: personal communication), and
the second by Aarex on his large number site. It falls between 3^^^4 and 3^^^5 in
up-arrow notation, and it can be estimated like so:
Square(x) is in general roughly 10^^x
Pentagon(3) = square(square(square(3)))
= square(square(triangle(triangle(triangle(27)))))
= square(square(triangle(triangle(27^27))))
~ square(square(triangle(10^10^40))))
~ square(square(10^10^10^40)
~ 10^^10^^10^10^40, between a giggolplex and a giggolduplex
2^^2^^2^^9
This value is the current upper bound to the problem upper-bounded by Graham's
number, proven in 2013. It is vastly smaller than Little Graham, much smaller than
G(2) or even G(1). It falls between a grand mega and a tetra-taxis. The current
lower bound is 13.

Tetra-taxis
10^^^4
Taxis was chosen to indicate that the numbers are tetrational towers.
Giggolduplex
10^^10^^10^^100
A power tower of a giggolplex 10s - the second recursive step from a giggol.
Grangoldudex
E100#100#3
A power tower of a grangoldex 10s topped off with a 100.
Ekatommyriaplo ekatommyriaplekatommyriakis ekatommyriaplo
ekatommyriaplekatommyriakis ekatommyriaplo ekatommyriaplekatommyriakis ekatommyrio
E(E(E(106)))
This is the largest number Harry Foundalis names in his extended system to the
Greek numbers' names. It exhausts exponential notation entirely and is defined with
a function E(x) defined as:
E(1) = 103*10^6,000,000+3
x > 1: E(x) = 103*10^(6*E(x-1))+3
E(x) can be estimated to be equal to about 10^^(2x+1) in terms of Knuth's up-
arrows, or more crudely 10^^x when working with larger inputs. Therefore the entire
number can be estimated as:
10^^10^^10^^2,000,001
YIKES!!! That's a RIDICULOUSULY huge number named with a system, and it UTTERLY
leaves even Bowers' illions in the dust! It's a pentational number which would
laugh at ANY of Bowers' illions.

f4(4)
~ E21#3#4 or 10^^10^^10^^10^10^10^21
This number is equal to f4(4) or fw(4) in the fast-growing hierarchy - it's an
ABSOLUTE MONSTER OF A NUMBER!! It leaves all the weeny tetrational numbers like
f3(100) in the dust and is a decent pentational number not too much less
(relatively speaking) than 5^^^5.
Great Mega
4[5]
This number (once again by Aarex) is about 10^^10^^10^^10^10^10^617, or more
crudely 10^^10^^10^^10^^4, so it’s between f4(4) and boogafive.
Boogafive
5^^^5
5^^^5 is the next member of the booga- sequence after 4^^4 - the value is monstrous
and can be imagined like so:
5^5^5^5^5^5^5........^5
w/ 5^5^5^5^5^5^5........^5 5s
w/ 5^5^5^5^5^5^5........^5 5s
w/ 5^5^5^5^5 5s
The value falls between a great mega and a penta-taxis.
Penta-taxis
10^^^5
Giggoltriplex
10^^10^^10^^10^^100
Gong Mega
5[5]
This is 5 in a pentagon with Steinhaus-Moser notation, a number that I've estimated
falls between a giggoltriplex and a hexa-taxis.
Hexa-taxis
10^^^6
Hexomega
6[5]
After that we have a heptomega, octomega, and a nonomega (which I prefer calling an
ennomega).
Gagfive
A(5,5) = 2^^^8-3 ~ E4#65,533#5
This is the next member of the gag- series - its computation is very hard to
visualize and it falls between a hexa-taxis and a hepta-taxis.
Hepta-taxis
10^^^7
Octa-taxis
10^^^8
Ena-taxis
10^^^9
Deka-taxis/Gigafuga-ten
10^^^10
Gigafuga-x (a prefix I made) is x^^^x. It's mostly just for fun.
Endeka-taxis
10^^^11
A lower bound for the megiston.
Megiston
10[5]
Main article: Steinhaus-Moser Notation
This is the second of the three official Steinhaus-Moser numbers, defined by
Steinhaus as 10 in a pentagon in Steinhaus-Moser notation. It has been mistakenly
called megistron and also megaston, and for a while Googology Wiki called it
megistron.
A megiston is much much larger than a mega but much much much smaller than Moser.
It’s between 10^^^11 and 10^^^12. It's a number that, unlike the mega, takes full
advantage of the pentagon operator to produce a decent pentational number! It's
also harder to bound than Steinhaus's mega.
Here’s how to calculate a megiston:
First take 10, take it to the power of itself, take that to the power of itself,
then take THAT to the power of itself, and do it 10 times total. The end result is
stage 1.
Then take stage 1, take it to the power of itself, take that to the power of
itself, then take THAT to the power of itself, and do it stage 1 times total. The
end result is stage 2.
Continue, and this number is stage 10! However, the Moser, which was coined by
Moser instead of Steinhaus, just transcends both the mega and megiston!
Dodeka-taxis
10^^^12
An upper bound for the megiston.
10^^^68
A lower bound to Genu's Number II.
Genu's Number II
70!2*35!2*812,500*812,500812,500

The guy who coined Genu's Number decided to post a sequel to the number on another
Wikia wiki. He called it Genu's Number II in an attempt to trounce his previous
number. Though it's unfathomably larger than the previous number, unfortunately
it's still a salad number ... a really really bad one. It can be intuitively
recognized as such, and in fact it can be shown that:

10^^^68 << Genu's Number II << 10^^^71 (for proof of this click here). This also
shows that Genu's number is much less than a gaggol.
10^^^71
An upper bound to Genu's Number II.
Gaggol / hecta-taxis
10^^^100
A gaggol (googolism by Bowers) is equal to ten pentated to the hundredth, or
{10,100,3} in array form. It is another googolism analogous to the googol and
giggol.
Here is how to imagine gaggol:
Stage 1 = 10
Stage 2 = 10^10^10^10^10^10^10^10^10^10 (10 10’s) = decker
Stage 3 = 10^10^10............^10^10 with stage 2 10’s
Stage 4 = 10^10^10............^10^10 with stage 3 10’s
....
Stage 100 = gaggol.
Gigafuga-hundred
100^^^100
Sbiis Saibian says that this number might be considered "the largest pentational
number" if you consider 100 to be the largest smallish argument in a pentation
expression. He himself notes that this is an arbitrary designation.
Megafuga-gaggol
(10^^^100)^^(10^^^100)
Make a power tower of a gaggol gaggols, and you still get something short of a
greagol. Improvements that sound amazingly mind-boggling are often really rather
trivial.
Greagol
E100#100#100
A greagol (great googol) is the next major Saibianism. It’s comparable to a gaggol,
even though gaggol^^gaggol<greagol. Here’s how you can imagine this number:
Stage 1 = 10^10^10.........^10^10^100 with 100 10s = grangol
Stage 2 = 10^10^10.........^10^10^100 with stage 1 10s = grangoldex
Stage 3 = 10^10^10.........^10^10^100 with stage 2 10s = grangoldudex
....
Greagol is stage 100, or grangol-99-dex. As you can see a greagol is similar to a
gaggol in size in the long run, but still significantly larger.
Greagoldex
E100#100#101
Just as -plex isn’t effective on a grangol, -dex isn’t effective on a greagol.
Therefore we define the new suffix -threx. If x = Ea#b#c#d, then x-threx =
Ea#b#c#(d+1).
Tetrofaxul
200!2
This googolism coined by Lawrence Hollom is the tetrational factorial of 200, which
simplifies to 200^^199^^198 ... ^^3^^2^^1. It's a decently large pentational
number, roughly comparable to a gaggol.
Greagolchime
E1000#1000#1000
Greagoltoll
E10,000#10,000#10,000
Greagolgong
E100,000#100,000#100,000
10^^^10^100
This is, in my opinion, the largest pentational number. The number after the up-
arrows matters more than the number before them, and the largest reasonably small
such number, to me (even though this is kind of arbitrary) is a googol. Now on to
up-arrow level numbers!
The Hyperoperator Range
10^^^10^101 - 10{10}10
Entries: 47
A-ooga / megision
2[6]
Coined by Aarex, this number is also called megision. Aarex didn't coin the name a-
ooga, but he did coin the name megision. Since it’s 2 in a hexagon, it can’t be
much worse than 2 in a pentagon, right?
WRONG. This number is equal to the already gigantic mega in a pentagon! Here’s how
it would be calculated:
First, take mega to the power of itself, then take that to the power of itself, and
take THAT to the power of itself, continue mega times, and that is Stage 1.
Next, take Stage 1 to the power of itself, then take that to the power of itself,
and take THAT to the power of itself, continue Stage 1 times, and that is Stage 2.
Next, take Stage 2 to the power of itself, then take that to the power of itself,
and take THAT to the power of itself, continue Stage 2 times, and that is Stage 3.
A-ooga is Stage mega, or roughly 10^^^mega.
G(1) / Grahal
3^^^^3
This is the first term in the sequence of numbers to evaluate Graham’s number.
Aarex calls this number grahal. It’s already a huge number, a mind-crushingly large
value that easily leaves tritri in the dust.
No, it isn't just a power tower of threes tritri threes high - 3^^^^3 makes THAT
value look adorable. Here’s how to evaluate it:
3^^^^3
3^^^3^^^3
3^^^tritri
3^^3^^3^^3......^^3 with tritri 3’s - i told you it'll get scary
This can be visually shown as:
Stage 1 = 3
Stage 2 = 3^3^3 = megafuga-three
Stage 3 = 3^3^3^3.......^3 with stage 2 3’s = Tritri
Stage 4 = 3^3^3^3..................^3 with stage 3 3’s
Stage 4 = 3^3^3^3....................................^3 with stage 4 3’s
    
..........
G(1) = Stage Stage 3 = Stage Tritri. This number is already super unfathomable.
It's cool due to being barely comprehensible in terms of power towers.
It can be represented visually as:

Robert Munafo made an interesting observation about 3^3, 3^^3, 3^^^3, and 3^^^^3:
he considers them examples of the first four superclasses of numbers (superclasses
are ideas, NOT clear-cut ranges).
3^3 (27) is small enough for anyone to visualize, so it's in superclass 1.
3^^3 (7,625,597,484,987) is too large to visualize, but it can still be understood
by comparing it to other real-world values like the population of a thousand Earths
or the number of cells in your arm, perhaps. Therefore, it's in superclass 2.
3^^^3 is too large to compare to ANY real world values, but its computation can be
visualized as taking three and call that stage 1, take three to the power of stage
1 and call that stage 2, and continue 7,625,597,484,987 - its computation can be
visualized, so it's in superclass 3.
3^^^^3 is too large to have a visualizable computation like 3^^^3, but its
computation can be understood by iterating power tower height tritri times, so it's
in superclass 4.
The next two superclasses are superclass 5 (computation is too abstract to be
understood) and superclass 6 (so large that nobody can hope to know anything useful
about it). Superclass 0 is the lowest part of the levels, where numbers are so
small that they can be easily understood even by animals.
Tria-petaxis
10^^^^3
x-petaxis is 10^^^^x. Petaxis means pentation towers.
Gaggolplex
10^^^10^^^100
This number is the gaggolth stage in the stages used to calculate a gaggol.
Greagolthrex
E100#100#100#2
The greagolth stage of the stages used to compute a greagol.
2^^^2^^^262,153
This hexational number was proven by Deedlit11 of Googology Wiki to be a lower
upper bound to the Graham's number problem. It's somewhat larger than G(1) but
vastly smaller than G(2), and larger than the current bound, which is a pentational
number.
Tritet
4^^^^4 or {4,4,4}
The tritet is another Bowerian googolism, equal to four hexated to the fourth.
Here's how it's computed:

Stage 1 = 4
Stage 2 = 4^4^4^4
Stage 3 = 4^4^4.........^4 with Stage 2 4’s
......
Now take stage 4, or super-stage 2. Put in that many stages, and that’s super-stage
3. Now put in super-stage 3 stages, and that’s super-stage 4, or tritet. Here’s a
more readable visual representation:

As you can see this number's computation is still visualizable. Tritet doesn't have
the same charm G(1) has as just barely visualizable since the additional layer of
iterated power towers makes it harder to understand the number.
Tetra-petaxis
10^^^^4
Gaggolduplex
10^^^10^^^10^^^100
Greagolduthrex
E100#100#100#3
Penta-petaxis
10^^^^5
Boogasix
6^^^^6
Can be imagined as:
6^6^6....^6 w/ 6^6^6....^6 sixes w/ 6^6^6....^6 sixes ......... w/ 6^6^6....^6
sixes w/ 6 sixes
w/ 6^6^6....^6 w/ 6^6^6....^6 sixes w/ 6^6^6....^6 sixes ......... w/ 6^6^6....^6
sixes w/ 6 sixes power towers
w/ 6^6^6....^6 w/ 6^6^6....^6 sixes w/ 6^6^6....^6 sixes ......... w/ 6^6^6....^6
sixes w/ 6 sixes power towers
w/ 6^6^6....^6 w/ 6^6^6....^6 sixes w/ 6^6^6....^6 sixes ......... w/ 6^6^6....^6
sixes w/ 6 sixes power towers
w/ 6^6^6....^6 w/ 6^6^6....^6 sixes w/ 6^6^6....^6 sixes ......... w/ 6^6^6....^6
sixes w/ 6 sixes power towers
w/ 6 power towers
YIKES! The value is by now iterating the degree of iteration of power towers - by
now it's very difficult to wrap your mind around.
Deka-petaxys / terafuga-ten
10^^^^10
Terafuga-x (I made the prefix) is x^^^^x.
A-oomega
10[6]
Or 10 in a hexagon. The is equal to megiston with the powerful pentagon operator
applied to it, NINE TIMES!
Geegol / hecta-petaxis / gavoogol
{10,100,4} = 10^^^^100 = g(5,100,10)
Yet another Bowerian googolism analogous to the googol, equal to ten hexated to
100. This number can be imagined as:
Stage 1 = 10 [going back to the stages for gaggol]
Stage 2 = 10^10^10^10^10^10^10^10^10^10 (10 10’s) = decker
Stage 3 = 10^10^10............^10^10 with stage 2 10’s
Stage 4 = 10^10^10............^10^10 with stage 3 10’s
etc.
Geegol is stage stage stage ... ... stage 1 with 100 stages. A dizzying value, but
still not that big a googolism.
Andre Joyce named this number gavoogol, since ga-x-oogol is apparently g(x,100,10)
(which is equal to 10^^^...^^^100 with x-1 ^s). It's the first member in the family
of numbers formed by Andre Joyce when he supposedly "got high", which I call the
gamoogol family. The next is gaxoogol, equal to g(10,100,10).
Terafuga-hundred
100^^^^100
Gigangol
E100#100#100#100
The next major extension to the googol of Saibian’s. This number’s name is short
for gigantic googol, because it’s, well, gigantic. Here’s how to visualize
gigangol:
Stage 1 = 10^10^10.........^10^10^100 with 100 10s = grangol
Stage 2 = 10^10^10.........^10^10^100 with stage 1 10s = grangoldex
Stage 3 = 10^10^10.........^10^10^100 with stage 2 10s = grangoldudex
....
Gigangol is stage stage stage ... ... ... stage 100 with 100 stages. This number is
comparable to a geegol, just as grangol is to giggol and greagol is to gaggol.
Pentofaxul
200!3
This is the pentational factorial of 200, equal to
200^^^199^^^198^^^197.......^^^3^^^2^^^1.
Gigangolgong
E100,000#100,000#100,000#100,000
Great Graham
3^^^^^3
This number is equal to three heptated to the third. It is a number coined on
Googology Wiki whose page was deleted for having no sources. It was created on the
analogy gross:great gross::Graham's number:? The author probably mistook Graham's
number to be 3^^^^3.
Geegolplex
10^^^^10^^^^100
In the stages used to calculate a gaggol and geegol, this is stage stage
stage......stage 1 with a geegol stages.
Gigangoltetrex
E100#100#100#100#2
With Saibian’s numbers, we constantly need to define new suffixes. This is stage
stage stage.....stage 100 with a gigangol stages.
Tetra-exaxis
10^^^^^4
After that we have eptaxis, octaxis, ennaxis, and dekaxis, followed by endekaxis
and dodekaxis.
Gigangoldutetrex
E100#100#100#100#3
Tripent
5^^^^^5 or {5,5,5}
A tripent is 5 heptated to the fifth, or a linear array of three fives. Jonathan
Bowers also defines a trisept and a tridecal (both of which we will see in a bit).
Aarex completes this tri-x series with trihex, trioct, and triennet (also known as
trienn).
For a visual representation of tripent which I made, click here.
Deka-exaksys/petafuga-ten
10^^^^^10

This is ten heptated to the tenth.

Gigol
10^^^^^100 = 10{5}100
A gigol is equal to ten heptated to the hundredth, expressible as the unwieldy
10^^^^^100 using up-arrow notation or as 10{5}100 using Bowers' operator notation.
Here’s how to represent a gigol:
Use the stages for the gaggol and geegol.
Gigol =
Stage Stage Stage Stage Stage.....................Stage 1
where there are Stage Stage Stage Stage Stage.....................Stage 1 stages
where there are Stage Stage Stage Stage Stage.....................Stage 1 stages
where there are Stage Stage Stage Stage Stage.....................Stage stages
                :                :                :                :              
:
                :                :                :                :              
:
                :                :                :                :              
:
                :                :                :                :              
:
                :                :                :                :              
:
                :                :                :                :              
:
                :                :                :                :              
:
where there are Stage 1 stages
with 100 lines. YIKES! This representation is truly insane.
Gorgegol
E100#100#100#100#100
This enormous number is short for gorged googol, which means “bursting with
fullness”. You can imagine it like so:
Use the stages for the greagol and gigangol.
Gorgegol =
Stage Stage Stage Stage Stage.....................Stage 100
where there are Stage Stage Stage Stage Stage.....................Stage 100 stages
where there are Stage Stage Stage Stage Stage.....................Stage 100 stages
where there are Stage Stage Stage Stage Stage.....................Stage 100 stages
                :                :                :                :              
:
                :                :                :                :              
:
                :                :                :                :              
:
                :                :                :                :              
:
                :                :                :                :              
:
                :                :                :                :              
:
                :                :                :                :              
:
where there are Stage Stage Stage (100 stages).....Stage 100 (a.k.a. gigangol)
stages
with 100 lines. This representation really makes this number feel gorged!
Hexofaxul
200!4
The hexational factorial of 200, equal to 200^^^^199^^^^198 ... ... ^^^^2.
Gigolplex
10{5}10{5}100
This number is like the representation of a gigol, but with a gigol lines instead
of merely 100!!
Gorgegolpentex
E100#100#100#100#100#2
This is like a gorgegol, but its representation has a gorgegol lines. A
gorgegoldupentex’s representation has a gorgegolpentex lines.
Goggol
10{6}100 or {10,100,6}
A goggol is equal to ten octated to the hundredth, yet another Boweian googolism.
I'm going to leave it to you to imagine this insane number - keep in mind that it's
still rather small amongst the googolisms though.

Gulgol
E100#100#100#100#100#100
This number is comparable to a goggol, and it’s short for *gulp* googol. Once
again, I’ll leave it to you to imagine this horrendously huge number. Hint: It’s
also a gorgegol-99-pentex.
Gulgolhex
E100#100#100#100#100#100#2
We take advantage of the prefix hexa- and use it to create -hex, simpler than the
redundant-sounding -hexex.
Trisept
7{7}7 = {7,7,7}
Three sevens in a linear array - this mind-boggling number is equal to 7 enneated
to the 7th.
Gagol
10{7}100 or {10,100,7}
A gagol is ten enneated to the hundredth, Bowers' last number of the form g-
(vowel)-(g or gg)ol.
Gaspgol
E100#100#100#100#100#100#100
This epic number is short for *gasp* googol. It is comparable to the gagol. Even
visual representations now are hard to get your head around, and cumbersome to
make.
Lower bound for q(5)
A(9,A(8,A(8,255)))
q(x) is a fast growing function which involves Laver tables - it's defined as the
smallest number n such that p(n) (which is the period of a the first row of a size
n Laver table) = 2x, and q(x) is the smallest y such that p(y) = 2^x. The first
four values of q(x) are 2, 3, 5, and 6, but the existence of q(5) hasn't been
confirmed - if it exists, it's at least this big. In up-arrow notation, this lower
bound is approximately 2{7}2{6}2{6}255, placing it between a gagol and a gagolplex.
Gagolplex
10{7}10{7}100
Gaspgolheptex
E100#100#100#100#100#100#100#2
Boogaten
10{8}10
Also the old value of Bowers' tridecal, a few entries later.
Ginorgol
E100#100#100#100#100#100#100#100
As insane as it looks. This number is short for ginormous googol and is comparable
to 10{8}100, although Bowers doesn't have a term for that value.
Ginorgoltetrex
E100#100#100#(E100#100#100#100#100#100#100#100)
This is an unusual number coined by Sbiis Saibian using ginorgol + the -tetrex
suffix. Because the -tetrex suffix has basically no effect on numbers this big, it
happens to be a salad number. The only reason this number is on this list is
because it's Sbiis Saibian's googolism number 1000 on his Hyper-E article - on all
his Extensible-E number lists he numbers his googolisms.
Ginorgoloctex
E100#100#100#100#100#100#100#100#2
Gaxoogol
g(10,100,10) = 10{9}100
Could be a continuation of giggol, gaggol, and geegol, but nah. Just a Joycian
googologism that is part of the gamoogol (the next number in the group) family. The
number is comparable to Saibian's new number, gargantuul.
Gargantuul
E100#100#100#100#100#100#100#100#100
A gargantuul, short for gargantuan googol, is one of Sbiis Saibian more recent
googolisms. It's approximately equal to 10{9}100, and it can be compactly written
as E100##9 using the ## operator.
Gargantuulennex
E100#100#100#100#100#100#100#100#100#2
The Multi-Arrow Range
10{10}10 ~ 10{10^100}102
(10{10}10 ~ order-type w)
Entries: 21
Tridecal / deka-endekaxis
10{10}10 or {10,10,10}
This googolism (pronounced "TRY-da-cal") was coined by Jonathan Bowers. It's equal
to three tens in a linear array, or ten dodecated to the hundredth. It's notable
because Bowers considers anything bigger than this an Infinity Scraper, so you
could say the real big numbers start here. This number is very horrendously huge -
it expands to
10{9}10{9}10{9}10{9}10{9}10{9}10{9}10{9}10{9}10
=
10{9}10{9}10{9}10{9}10{9}10{9}10{9}10{9}10{8}10{8}10{8}10{8}10{8}10{8}10{8}10{8}10{
8}10
=
10{9}10{9}10{9}10{9}10{9}10{9}10{9}10{9}10{8}10{8}10{8}10{8}10{8}10{8}10{8}10{8}10{
7}10{7}10{7}10
{7}10{7}10{7}10{7}10{7}10{7}10
etc.
The expression grows very rapidly and requires insane levels of iteration.
This is also the second and last Bowersism Joyce gets right, the other being
tritri.
With Saibian's -logue, -taxis, -petaxis, -exaxis, etc. series, this number can be
called deka-endekaxis.
Joycian boogol
g(11,100,10) = 10{10}100
Joyce attempted to define the boogol, and once again failed. Luckily, this time he
only made a small mistake. He mixed up the order; it should be g(101,10,100).
Googondol
E100#100#100#100#100#100#100#100#100#100
The googondol is the largest of Sbiis Saibian's primitive googol extensions. It's
short for "googondo googol" - googondo is a slang word for gigantic (Urban
Dictionary). This number is comparable to Bowers' tridecal and is approximately
equal to 10{10}101. It can be compactly written as E100##10 (see gugold for more on
that)
Googondoldecex
E100#100#100#100#100#100#100#100#100#100#2
g(1)
2{12}3
Little Graham was the original version of Graham's number. It is calculated as g(x)
= 2{g(x-1)}3, and g(1) = 2{12}3. The value simplifies to 2{11}4 = 2{10}2{10}4.
3{27}3
This is a number that shows up mostly when working with chained arrows of 3, like
in conway's tetratri (seen later). It can be expressed as 3->3->2->2 in chained
arrow notation, which simplifies to 3->3->(3->3->1->2)->1 = 3->3->(3->3) = 3->3->27
= 3^^^...(27 ^s)...^^^3.
Boogahundred
100{98}100
Notable for being "a little" less than a boogol.
Boogol
10{100}10 or {10,10,100}
A boogol is a frighteningly large Bowerian googolism, equal to 10 "dohectated" (the
102nd hyperoperator) to the hundredth. It expands to:
10^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^10
and it's yet another number analogous to the googol.
Gugold
E100##100
This Saibianism (short for golden googol) is comparable to a boogol, and comparable
to 10 102-ated to the 100th. It’s the end of Hyper-E and the beginning of Extended
Hyper-E. The main rules of Extended Hyper-E mimic up-arrow notation:
Ex##y=Ex#x#x#x#x......#x#x with y x’s
Ex###y=Ex##x##x##x##x......##x##x with y x’s
etc.
So this number can be written in regular Hyper-E as:
E100#100#100#100...................#100 with 100 100’s.
Hyperfaxul
200![1] = 200!200
This is 200{200}199{200}198{200}......4{200}3{200}2{200}1, making it broadly
comparable to Bowers' boogol. It's expressible as 200![1] using the very beginning
of Hollom's hyperfactorial arrays since x![1] = x!x.
Gamoogol
g(1000,100,10) = 10{999}100
The continuation from a gaxoogol. It doesn't seem quite completely right, but I
guess it works.
Gamoogood
g(1000,1000,1000) = 1000{999}1000
An odd jump from the previous number - it's kind of confusing, and hard to see
where Joyce will go from here.
Gamamoogood
g(1000,1000,1000,1000)
This is another odd continuation. It can be imagined as:
a1 = 1000{999}1000
a2 = a1{999}1000
a3 = a2{999}1000
.....
gamamoogood = a1000
By Sbiis Saibian's Knuth Arrow Theorem, (a{b}c){b}d ~< a{b}(c+d). Therefore, a2 can
be upper bounded by 1000{999}2000, a3 can be upper bounded by 1000{999}3000, etc.
so this whole number can be upper bounded by 1000{999}1.000.000.
Gamamamoogood
g(1000,1000,1000,1000,1000)
A usage of the 5-entry g-function. It's roughly 1000{1000}1000. making it vastly
smaller than the next entry. This is still smaller than the gamamamamoogood, equal
to g(1000,1000,1000,1000,1000,1000), seen after Graham's number.
Boogolgong
10{100,000}10
“Gonging” another Bowersism, just for the hell of it.
Gugoldagong
E100,000##100,000
Or E100,000#100,000#100,000#100,000.......#100,000 in Hyper-E with 100,000
100,000s. This number is about 10{100,000}100,001, so it would be comparable to a
boogolgong.
Gongol
10{10^100 - 2}100
This number, like the coogol, came from the blog "A googol is a tiny dot". It's
equal to 10 googolated to the 100th. The number was made just for fun. In a variant
of the 3-argument "hyper function" (a multi-argument version of up-arrow notation
sometimes used in computer programs), it's equal to hyper(10,10^100,100).
Boogagoogol / Med
10^100{10^100-2}10^100
This number was formerly named along with the bed (trooga(googol)) on Googology
Wiki - both are among the deleted googologisms because they were made up on the
wiki with no sources.
Gaggoogol
A(10^100,10^100)
= 2{10^100-2)10^100+3
This is the gag- prefix applied to the googol, a.k.a. the result of calling the
Ackermann function with a googol as both of the arguments. The value is comparable
to and slightly larger than the boogagoogol, but smaller than Sbiis Saibian's great
googol.
10{10^100}10
This number is probably about the largest up-arrow notation level number, seeing as
the googol to me is the limit of "smallish" arguments and the number of up-arrows
matters much more than the numbers before or after. Once again, this designation is
arbitrary.
Saibian's great googol
E100##1#2
This is an extended Hyper-E number by Sbiis Saibian, which he calls great googol.
It simplifies to E100#100#100#100...............#100 with a googol 100's, and it's
about 10{10^100}101 (upper-bounded by 10{10^100}102), making it comparable to a
gongol. See also great googondol, equal to E100##10#2.
There is also a number Andre Joyce named great googol, equal to exactly 10^1000,
which Saibian calls googolchime - see the entry for 10^1000 for more.
These numbers may seem huge, but they're just preliminaries to some far more
horrifying numbers - welcome to part 4 of this list.
PART 4: THE BIGGER INTERMEDIATES
order type w ~ w^w
Here you'll find some really big numbers like graatagold, supertet, and iteral,
expressible with functions of order types between w and w^w in the fast-growing
hierarchy. Prepare for a frenzied hurry towards infi - oh wait this is just the
beginning of what googology has to offer!
The Expansion Range
10{10^100}10 ~ 10{{1}}10{10}10
(order type w+1)
Entries: 61
Gammagoogolplex
g(2000,g(2,2,50,100),50,100) ~ 100{10^5000-1}10,000
This number is one of Joyce's more recent googolisms. In summer 2014 he created a
lot of crazy numbers (see also the gamoogol family), and this is one of them. Most
of Joyce's new numbers are not on this list, as I find a lot of them to be silly or
salad numbers. However, I decided to add this one to this list because of its cool
name.
The double m in the name means 2000 (in Roman numerals), googolplex comes from a
false definition of the googolplex incorporated in the definition, and the rest of
the names's origin is unclear.
Deltagoogolplex
g(20000,g(2,2,50,100),50,100) ~ 100{10^5000-1}100,000
If there's one thing Andre Joyce loves to do, it's extrapolating from the names of
numbers. Here, he noticed the Greek letter "gamma" in gammagoogolplex, and
extrapolated to get "deltagoogolplex", since delta is the Greek letter after gamma.
Note: Normally I would put a comma in 20000 so that it would be 20,000, but that
comma can be confused with a comma separating arguments in the g function, so I had
to omit the comma.
Omegagoogolplex
g(2*10^24,g(2,2,50,100),50,100) ~ 100{10^5000-1}10^25
Andre Joyce decided to extrapolate further from deltagoogolplex to
epsilongoogolplex, zetagoogolplex, etc all the way to omegagoogolplex. Really, he
only lists gammagoogolplex, then deltagoogolplex, then skips all the way to
omegagoogolplex. He actually messed up the definition, but I'd rather be logical
than verbatim here.
Gongplexol
10{10^10^100-2}100
A number I coined for fun in analogy to the gongol - this is equal to 10
googolplexated to the 100th.

Moser
2[2[5]]

Main article: Steinhaus-Moser Notation

Also called Moser’s number, this gigantic number is 2 in a mega-gon (polygon with
mega sides) in Steinhaus-Moser notation. Unlike the mega and megiston, Leo Moser
coined this number, taking advantage of his idea of polygons with any number of
sides instead of just triangles, squares, and circles, and plugging in a huge
number of sides to form this giant.
The Moser just transcends the mega and megiston in a whole new way - it actually
holds an interesting place among the googolisms. That is because the number of up-
arrows usable to approximate this number is a high tetrational number, and
therefore in a way it can be imagined as laying at the edge of the land of familiar
up-arrows and gazing into a land of epic iteration and recursion, where Graham's
number is just the beginning!
The Moser's last digits are ...1056, and it's equal to about 2^^^ ... (mega-2
^s) ... ^^^3 in terms of Knuth's arrows.
Joyce's tetratri
g(2,1,1,4,3,3) = g(g(4,3,3),3,3)
Not to be confused with my Joycian Tetratri (in part 3). Joyce attempted to define
Bowers' larger numbers as well. Joyce's definition is equal to 3^^^ ... ^^^3 with
3^^^3 - 1 ^s. It looks pretty insane, but it's NOT EVEN CLOSE to the real tetratri!
The real tetratri makes this look tiny.

Tritriplex
3{tritri}3 = 3{3{3}3}3 = 3{{1}}3

This number shows up a lot when working with 3’s in 4-entry arrays - it’s much more
than the Moser and much less than G(2). On this scale, it's virtually
indistinguishable from the previous number.

G(2)
3{3^^^^3}3

Or 3^^^^^^^ ... ^^^^^^^3 with G(1) ^s. Yikes. This number is the second term in the
road to Graham. Aarex calls this graham grahal.

10{10{10}10}10 = {10,3,1,2}

This is ten expanded to the third, which can be written using Bowers' hyper-
operator notation as 10{{1}}3 or in array notation as {10,3,1,2}, since a expanded
to b is a{{1}}b = {a,b,1,2} = a{a{a ... {a{a}a} ... a}a}a with b a's from the
inside out. Therefore this number simplifies to 10{{1}}3 = 10{10{10}10}10 =
10^^^...(tridecal ^s)...^^^10.
Great googondol
E100##10#2
This number decomposes to E100#100#100#100 ... #100 with a googondol 100s. It's
comparable to 10{10{10}100}100 in terms of up-arrows. It was coined by Saibian as a
hint on what will come next in his numbers.
g(2)
2{2{12}3}
The second step in calculating Little Graham.
Magthree
A(A(A(3,3),A(3,3)),(A(A(3,3),A(3,3))) = A(A(61,61),A(61,61))
After the gag- prefix was defined, someone else suggested to continue with a mag-
prefix, equal to gag-gag-gag-gag.....-gag-n n times. Therefore, magthree is equal
to gag-gag-gag-3 = gag-gag-61 ~ 10{10{59}10}10. The value falls between g(2) and a
boogolplex.

Boogolplex
10{10{100}10}10

Or 10^^^^ ... ^^^^10 with boogol ^s. The next level of recursion from a boogol.

Gugolda-suplex
E100##100#2

With numbers above a gugold, we need to define a new array of suffixes. -suplex is
the first one. x-suplex, where x=Ea##b#c, is Ea##b#(c+1).

This number is also equal to E100#100#100....#100 with a gugold 100s.

Kilohyperfaxul
(200![1])[1]

After that there’s a mega-, giga-, etc. hyperfaxul.

Joyce's pentatri
g(3,1,1,4,3,3)
Not to be confused with my Joycian Pentatri (earlier in this list). This is equal
to 3^^^^^^..........^^^^^^3, with 3^^^.....(3^^^3 - 1 ^s).....^^^3 - 1 ^s, so it
iterates the number of up-arrows twice. The real pentatri is UNFATHOMABLY larger
than this or even the tetratri - it can't remotely be compared to this number, as
they aren't even in the same realm of numbers!

Tritriduplex
3{3{3{3}3}3}3 = 3{{1}}4

A lower bound to my Joycian Hexatri, equal to 3{tritriplex}3. Also an upper bound

to Joyce's pentatri.

Joycian Hexatri
g(3,3,3,3,3,3)

Another g-function number I coined. This is approximately 3{3{E14#5#2}3}3, placing

it between 3{3{3{3}3}3}3 and 3{3{3{4}3}3}3 (G(3)). It’s around E3##(E14#5#2)#2 in
Extended Hyper-E.

Joycian Heptatri
g(3,3,3,3,3,3,3)

Yet another g-function number. Because of the g-function’s erratic behavior, this
is almost no bigger than the Joycian Hexatri.

Joycian Octatri
g(3,3,3,3,3,3,3,3)

Ditto.

G(3)
3{3{3{4}3}3}3

This number is 3^^^....^^^3 with G(2) ^s. It also serves as an upper bound to the
Joycian Hexatri.
Joycian grand tridecal
g(3,1,1,11,10,10)
The grand tridecal is the next of Joyce's epic fails at trying to define Bowerian
numbers - this is approximately equal to 10{10{10{10}10}10}10 = 10{{1}}4 - the real
grand tridecal is far far bigger, at 10{{10}}10. Hell, it isn't even close to as
big as the pentatri or even the tetratri!

Gugolda-dusuplex
E100##100#3

This number is also E100#100#100....#100 with a gugolda-suplex 100s.

Little Graham / Graham-Rothschild Number
g(7) = 2{2{2{2{2{2{2{12}3}3}3}3}3}3}3
Main article: Graham's Number
This number is the original version of Graham's number. Sbiis Saibian calls it
"Little Graham", and Robert Munafo calls it the Graham-Rothschild number (he calls
the number now known as Graham's number the Graham-Gardner number). It was defined
by Ronald Graham and Bruce Rothschild in a paper about Ramsey theory, as an example
demonstrating how hard it is to find upper bounds in certain areas of that field,
even when the problem is that simple. It was once the best upper bound to the
problem where it came up, but now the best bound 2^^2^^2^^9. It is defined
similarly to Graham's number, like so:
g(1) = 2^^^^^^^^^^^^3 (12 ^s)
g(2) = 2^^^...(g(1) ^s)...^^3
g(3) = 2^^^...(g(2) ^s)...^^3
etc.
g(7) is Little Graham
Little Graham is FAR less well known than Graham's number, and many people who know
of Graham's number don't know that Little Graham was the real upper-bound and
Graham's number is an alternate easier-to-explain version created to popularize the
number. Even Little Graham is no longer the best upper-bound, and many people still
think the best upper-bound is Graham's number.

G(8)
The first member of Graham's sequence bigger than Little Graham.
Joycian dimentri
g(27,1,1,4,3,3)
Agghhhh ... what was Joyce THINKING here? This definition is approximately equal to
3{{1}}28, upper-bounded by G(27) in Graham's function. Here Joyce is so wrong it
hurts. He probably thought dimentri is equal to {3,3,3,3.....3,3,3,3} with 27 3's,
but the threes are arranged in a 3x3x3 CUBE! Either way he's not even REMOTELY
close.

3{{1}}65 = {3,65,1,2}

A BEAF lower-bound to Graham. This number is 3{3{3.....{3{3}3}......3}3}3 with 65

3’s from the center to the right end. It’s like Graham but starting with tritri
instead of G(1).
g(64,1,1,5,3,3)
A very (on this scale) exacting lower bound for Graham's number in Joyce's g
function. It can be defined similarly to Graham's number like so:
GB(1) = 3^^^^3
GB(2) = 3^^^...^^^3 with GB(1)-1 ^s
GB(3) = 3^^^.....^^^3 with GB(2)-2 ^s
....
The approximation is GB(64). If it weren't for the offset from up-arrows, the g
function could exactly express Graham.

Graham’s number / Graham-Gardner Number

G(64)

Main article: Graham's Number

Graham's number is a famous number that is typically thought of as an upper-bound

to the solution of a problem in Ramsey theory, a field of mathematics dealing with
the minimal conditions in which certain conditions must necessarily arise. The
problem asks, what is the minimum number of dimensions N of a hypercube such that
all 2-colorings of all vertex pairs of the hypercube would necessarily have a
coplanar complete graph of 4 vertices? That problem sounds complicated, but it's
actually quite simple. Read the article on Graham's number for an explanation of
the problem.
Here is the definition of Graham's number:

G(n)=3{G(n-1)}3
G(1)=3^^^^3
Graham’s number = G(64)

Or more visually:
G(1)=3^^^^3
G(2)=3^^^...^^^3 with G(1) ^s
G(3)=3^^^.....^^^3 with G(2) ^s
...
Graham’s number is G(64), or G for short. This number is famous because it was at
one time the largest number used in any serious mathematics, which basically means
the largest number to most people. The number was made famous in an article by
Martin Gardner describing the number, and it even found its way to Guinness World
Records, replacing Skewes' numbers (both have entries earlier in part 3). Because
Gardner made this version of Graham's number famous, Robert Munafo calls this
number the Graham-Gardner Number.
Graham's number did indeed appear in a mathematical proof in Ramsey theory by
mathematician Ronald Graham in 1977, as an upper bound in a problem where the lower
bound was six. However, the story is different from what most people think. The
original Graham's number was Little Graham, the number that appeared in the 1971
proof. When Martin Gardner noticed the problem where Graham's number arose, he was
intrigued by its size, and decided to devise an easier-to-explain but larger number
that Graham proved in an later unpublished paper to share to the world. Therefore
the number we know as Graham's number is more attributable to Gardner than Graham!
Nonetheless, Graham's number made it to Guinness World Records as the largest
number used in a mathematical proof. Both bounds have since been improved, the high
one from Little Graham to the relatively humble 2^^2^^2^^9, and the low one to 11
and then to 13. Many people still seem to think that Graham's number is still the
best upper-bound, even though it never was.
Now, there are larger numbers used in mathematics which have dethroned Graham, such
as TREE(3), SCG(13), and other terms in far-reaching sequences. Nevertheless,
Graham’s number remains famous, and is still mistakenly thought by many as "the
largest useful number". This is because the "largest number used in a mathematical
proof" title was taken off of Guinness World Records in 1980, not long after
Graham's number was created. That's a shame, because now more people can't hear of
bigger better numbers like TREE(3), which is actually better than Graham's number
since it isn't an upper bound, but an actual answer to a fairly simple problem that
ends up surprisingly huge (and mind-crushingly larger than Graham's number mind
you) - but in all fairness, TREE(3) is much harder to explain than Graham's number.
In fact, the hype about Graham's number is not entirely a bad thing - Graham's
number can be seen as an eye-opener, a relatively simple number that grasps
newcomers' attention, introducing people to the wonderful world of googology.
An interesting fact about Graham's number is that even though it's WAY too huge to
compute, we can use modular exponentiation to find its last digits without too much
trouble - this is because Graham's number is a gigantic power tower of threes. The
last 500 digits of Graham's number are:

  02425950695064738395657479136519351798334535362521
43003540126026771622672160419810652263169355188780
38814483140652526168785095552646051071172000997092
91249544378887496062882911725063001303622934916080
25459461494578871427832350829242102091825896753560
43086993801689249889268099510169055919951195027887
17830837018340236474548882222161573228010132974509
27344594504343300901096928025352751833289884461508
94042482650181938515625357963996189939679054966380
03222348723967018485186439059104575627262464195387

These digits don't just end Graham's number, but they also end G(63), G(62), G(61),
... G(3), G(2), and even G(1) and 3^^^3. In fact, those end any power tower of over
500 3’s, such as G(65), G(66), G(67), ... G(G(64)), and bigger 3-based googolisms
like tetratri, ultatri, latri, dimentri, triakulus, or the outrageous big boowa.

Graham's number times a googolplex

G(64)*10^10^100
Sbiis Saibian, at the beginning of his number list, gives Graham's root of
googolminex and one (the Graham's numberth root of the sum of one and the
reciprocal of a googolplex) as an example of a very small large number. That
creates a notable apparent paradox - googologists have it implanted in their mind
that, for example, graham's number times a googolplex is indistinguishable from
Graham's number in googological terms. But on the other hand, raising Graham's root
of googolminex and one to the power of Graham's number gives googolminex and one,
which is still very close to one, but raising googolminex and one to a googolplex
(i.e. raising Graham's root of googolminex and one to the power of (Graham's number
times a googolplex) gives a much larger number, almost equal to the mathematical
constant e!
So you may now think that Graham's number and Graham's number times a googolplex
are once again in two different realms of numbers! However, googologists can really
forget about that kind of stuff, as that doesn't change that GRAHAM'S NUMBER TIMES
A GOOGOLPLEX IS INDISTINGUISHABLE FROM GRAHAM'S NUMBER! It's all about the counter-
intuitivity of numbers this big ... but hold on now, we're just getting started
with some FAR BIGGER NUMBERS!
If you want to make Graham's number times a googolplex NOT seem much bigger than
Graham's number, start by imagining all the digits of Graham's number, and then
adding a googol zeros at the end. With the huge number of digits in Graham's number
(which is approximately equal to Graham's number), since a googol is so much
smaller than the number of digits in Graham's number, adding a googol more digits
is barely a blip on the map!
Graham's number factorial
G(64)!
This number is a common retort to Graham's number based on a common misguided idea
- it's that no matter how big the number is, a powerful (by layman standards)
function like the factorial will always be a huge improvement on the number. Well
guess what - that's wrong, and at this point Graham's number factorial is far less
than even G(65)! Don't believe me?! I'll show you how that can be, using Sbiis
Saibian's Knuth Arrow Theorem, which states that for a≥2, b≥1, c≥1, x≥2, (a{x}b)
{x}c < a{x}(b+c).
Consider that n! = n*(n-1)* ... *3*2*1 < n^n = n*n* ... *n*n*n. Then:
G64!
< G64^G64
= (3{G63}3)^(3{G63}3)
<< (3{G63}3){G63}(3{G63}3)
< 3{G63}(3+3{G63}3)
<< 3{G63}(3{G63}3{G63}3)
= 3{G63}4
<<< 3{G63}3{G63}3 = 3{G64}3 = G65
Graham's number to the power of Graham's number
G(64)^G(64)
Ditto. Besides, why should you build upon Graham's number when it isn't hard to
build FAR FAR FAR LARGER NUMBERS from the ground up with things like the Ackermann
function? Iterating the Ackermann function can easily crush Graham's number, for
instance.
E(3)3##4#64
A Hyper-E upper bound to Graham's number. This can be visually represented like so:
E(3)3#3#3#3........#3
w/ E(3)3#3#3#3........#3 3's
w/ E(3)3#3#3#3........#3 3's
w/ E(3)3#3#3#3........#3 3's
.........
w/ E(3)3#3#3#3........#3 3's
w/ E(3)3#3#3#3 3's
with 64 layers total. It's a relatively exacting bound - it's less than even the
next upper bound.
Graham-Conway Number
{4,65,1,2} = 4{{1}}65
Main article: Graham's Number
In Conway and Guy's Book of Numbers, Conway described Graham's number same as how
it's usually described, but being based upon fours instead of threes. This
alternate version of Graham's number is known as the Graham-Conway number. This
alternate version of Graham's number is usually believed to be an error, but in
fact it isn't: Conway has said that "Ronald Graham had originally used fours",
according to Sbiis Saibian personally communicating with Conway (source). This
however opens a whole new array of questions: did he refer to in the 1971 paper
with Rothschild or the 1977 paper with the new Graham's number, and when/how was it
changed to the threes version? Therefore this is really a mysterious version of
Graham's number - see my article on Graham's number for more on that.
This number, unlike the other two versions of Graham's number, can be compactly
expressed in Bowers' array notation as {4,65,1,2}. None of them can be expressed
compactly in terms of Conway's chain arrows though.
3{{1}}66 = {3,66,1,2}

A BEAF upper-bound to Graham. This is like Graham’s number, but you start with
3{tritri}3 instead of 3^^^3. It’s equal to 3{3{3.....{3{3}3}......3}3}3 with 66 3’s
from the center to the either end.
xkcd number
A(G64,G64)
An xkcd comic titled "What xkcd Means" said in one panel "It means calling the
Ackermann function with Graham's number as the arguments just to horrify
mathematicians". We saw how much of a hassle it was to directly work with the
Ackermann function in the entry for 61, so using Graham's number as the arguments
would be fucking scary, right?
It turns out that this number, representable in up-arrow notation as 2{G-2}(G+3) -
3 (G is Graham's number), turns out to fall just under G(65) - only two levels of
recursion less (i.e. pretty much the same value in googological terms). It's a
borderline case of a salad number.

G(65)

A common retort to Graham's number. People who come up with numbers like this
think, Graham's number is the largest number ... or it was, until I cleverly came
up with G(65) instead of G(64).

G(64) {G(64)} G(64)

This is an example of a retort to Graham's number that is at least measurably

different from Graham's number. It seems to be an amazing improvement, and yet it's
still smaller than G(66). To see why consider this:
G(64) {G(64)} G(64)
= (3{G63}3){G64}G64
< (3{G64}3){G64}G64
< 3{G64}(3+G64)
< 3{G64}G65
= 3{G64}3{G64}3 = 3{G65}3 = G(66)
This seems utterly paradoxical, but it's still a relatively tame example of the
strange behavior with numbers this big!

Corporal
10{{1}}100 = {10,100,1,2}

This is the smallest Bowersism bigger than Graham's number. It's equal to ten
expanded to the hundredth. It’s like a little corporal but with 100 layers, and it
can be imagined as:

Stage 1 = 10
Stage 2 = 10^1010
Stage 3 = 10^Stage 210
...
Corporal is stage 100

It's a number very much like Graham's number but notably larger, falling between
G(99) and G(100).

I have also developed my own extensions to this number, which appear on this list.

G(100)

Another obvious attempt at trouncing Graham. This passes the corporal but is still
smaller than Saibian’s graatagold.
fw+1(100)
This entry is used to discuss the fast-growing hierarchy's order type omega plus
one. It's the same order type Graham's function has, and it's a major turning point
in large numbers.
Why is that? Because from numbers of the scale of w+1 in the fast growing hierarchy
onwards, the fast-growing hierarchy becomes pretty much the universal approximation
notation for numbers among googologists - numbers of this size onwards are usually
approximated with the fast-growing hierarchy.
It's notable because before order type w+1, up-arrow notation and Hyper-E notation
are often used to approximate large numbers, but after that point, one special
notation becomes nigh universal, mainly because of its simplicity and growth speed.
Side note: In Bowers' notation, this number is about 99{{1}}101.

Graatagold
E100##100#100

Let stage 1 be E100#100#100....#100 with 100 100’s.

Stage 2 is E100#100#100....#100 with Stage 1 100’s.
Stage 3 is E100#100#100....#100 with Stage 2 100’s.
...
This number, short for gratuitous golden googol, is stage 100. It’s comparable to
the corporal. It’s the smallest Saibianism bigger than Graham, but it’s still not
too much bigger...relatively speaking.

G(101)

The smallest number in Graham’s sequence bigger than a graatagold.

Output of ioannis.c
~ fw+1(115), or between G(115) and G(116) in terms of Graham's function
This is an entry in Bignum Bakeoff submitted by a man named Ioannis. It's a big
jump from the previous entry - unlike the tetrational numbers, this number leaves
tetration and even up-arrow notation in the dust, and it's bigger than Graham's
number, or even G(115) in the sequence! It's actually the smallest entry in Bignum
Bakeoff to be bigger than Graham's number. In terms of Bowers' arrays, this number
is about 9{{1}}116.
Ioannis achieves this magnitude by defining a 3-argument function similar to the
Ackermann function noted a(x,y,z), and then creates a function called d(n), equal
to a(n,n,n). Then Ioannis applies d(n) to 9 115 times making a number,
d(d(d(d(d(d(d(.........d(9).......))))) with 115 d's. Even though this number is
already bigger than Graham's, the next Bignum Bakeoff number is far far larger than
Graham's number and utterly leaves it in the dust!

200![2]

This is a hyperfactorial array notation number in the same spirit of Hollom's

googolisms which falls between hyperfaxul and giaxul. It evaluates to 200![1]![1]!
[1] ... ![1] with 200 repetitions of ![1]. In general, x![y]~x{{y-1}}x.
Gamamamamoogood
g(1000,1000,1000,1000,1000,1000)
This number is the largest member of the gamoogol family. It's approximately
G(1000) in Graham's function - it's still less than Joyce's googolplux, -pluc, and
-plum.
Joycian dulatri
g(19683,1,1,4,3,3)
This is an ESPECIALLY stupid Joycian attempt at expressing a Bowersism. First off,
the array does NOT contain 19,683 threes, it contains merely 729 threes! Joyce
probably thought it was 19683 because he read the (3^3)^2 array as 3^3^2 (he is
said to be a mathematician, but he really doesn't know his exponential laws). Even
though he thought the number of entries was larger than what it actually is, this
is still UNFATHOMABLY smaller than the real dulatri.
The real dulatri is formed with a much more complicated array. It's past even
iterating the number of dimensions - in Bowers' arrays, infinite-dimensional space
forms a block. Then you can have multiple blocks, and the dulatri is a cube of
THESE blocks! And this definition is merely basic recursion! It's upper-bounded by
G(19,683).

Graatagoldagong
E100,000##100,000#100,000

Yay more gong numbers.

Forcal
G(1,000,000)
A forcal is a googolism coined by Aarex, equal to G of one million in Graham's
function. He actually has a whole family of forcal-based numbers coined with a
notation he calls Aarex's Graham Generator, which extends on Graham's function and
goes up to the level of w^w in the fast-growing hierarchy.
Joycian trimentri
g(3^27,1,1,4,3,3)
This is not even close to the trimentri, needless to say. Although he got the
number of entries right, this can be upper-bounded by G(3^27) - he can't go past a
single recursive step from Graham.
How is the trimentri array formed? It's harder to explain. First, call those
infinite-dimensional blocks X1. After a cube of those blocks, we can have a
tesseract, 5-D cube, 6-D cube, etc. of these blocks. Then an infinite-sized
infinite dimensional block of those blocks is X2. After X2, we can have an
infinite-dimensional block of THOSE, and call that X3, then an infinite dimensional
block of X3s is an X4 - continue with X5, X6, X7, and continue infinitely - call
that block Y. Then you can have a row of Ys, grid of Ys, cube, tesseract, 5-D cube,
6-D cube of Ys.....infinite dimensional block, X2 block, X3 block of Ys, and a Y
block of Ys - call that Y block of Ys Y2. Then we can have a Y block of Y2s, and
call that Y3 - continue with Y4, Y5, Y6, and continue infinitely. That block is Z,
the block required for a trimentri. It's OK if this is hard to understand.

G(googol)

Yet another extension to Graham - also a fairly accurate lower bound for the
maggoogol and bed.

Bed
trooga(googol)

Wait, whoa now. What the heck is trooga?!?! This number used to have an article on
the Googology Wiki, but its article was deleted due to no proper sources. Cloudy176
of the wiki, however, has a list he calls The Best of Deleted Googologisms. Most of
them are either salad numbers, numbers with ridiculous names, or ridiculous
definitions, or any combination of those. Some of them don’t even have a meaningful
definition, like Sam's number (which is only described as so big that it can't be
described and far far larger than Rayo, and therefore it isn't even a number)! Many
such definitions are very inconsistent as well. The bed is one of the few with a
logical definition and name, but still....bed is a weird name for the number. Let’s
hope you don’t sleep for this many hours!

But what IS trooga? Trooga(x) is booga(booga(booga(booga..........

(booga(x))....)))), nested x times - a few booga- numbers were seen earlier. The
function achieves growth rates of w+1 in the fast-growing hierarchy, the same
growth rate achieved by Graham's function.

Trooga(x) is slightly less than {x,x+1,1,2}, so this number is about

{googol,googol+1,1,2}, between G(googol) and G(googol+1).
Maggoogol
gag-gag-gag-.....gag-googol (googol gags)
Another number nameable with the mag- prefix. The value is (on a googological
scale) barely bigger than a bed, and falls between the cracks of G(googol) and
G(googol+1).
G(googol+1)
An upper bound to the maggoogol and bed.

G(googolplex)

A lower bound to Joyce’s googolplux, and another common retort to Graham's number.

Joyce's googolplux
g(g(3,2,g(2,100,10)),1,1,2,100,10)

Here’s a weird Joycian googolism - god knows what he was thinking when he coined
it. It evaluates to:

g(g(3,2,10^100),1,1,2,100,10)
g((10^100)^^2,1,1,2,100,10)
g(10^10^102,1,1,2,100,10)

Now we need to define star notation. It’s an offest version of up-arrow notation
where a*b = a*b, a**b = a^b, a***b = a^^b, etc. Now this number can be visually
represented as:

10**100 (googol)
10****.....*****100
10*******.......*******100
10*******.......*******100
10*******.......*******100
: : : :
: : : :
10*******.......*******100 with 10^10^102 layers, where each layer has as many
stars as the number of the previous layer.

Weird, yet pretty cool.

G(10^10^102)

An upper bound to Joyce’s googolplux.

Yudkowsky's Number
G(3^^^^3)
This number was mentioned by Eliezer Yudkowsky in an article of his titled "Staring
at the Singularity". It's a pretty cool number that he gave as an example of a
number that you can easily make which is mind-bogglingly larger than Graham's
number. It can be expressed as G(G(1)), which is interestingly among the HUGE gulf
of numbers between things like G(googolplex) and things like G(Graham's number). As
Sbiis Saibian said, this begs the question: why stop here?
Yudkowsky has had quite some involvement with googology, and he's been on the
googology wiki a few times as well - in googology he is perhaps best known for a
post on his Tumblr blog: Why isn't googology a recognized field of math? It's an
interesting discussion on the obscurity of googology, but some people, such as the
founder of Googology Wiki have quite different views on the subject. Nonetheless
it's interesting that someone as famous as Yudkowsky (yes he even has his own
Wikipedia article) got involved in the obscure world of googology beyond the
popular stuff like Graham's number and Conway chain arrows.

G(gagol) = G(10{7}100)

A rough lower bound to Joyce’s googolpluc.

Joyce’s googolpluc
g(g(g(2,2,3),2,g(2,100,10)),1,1,2,100,10)

A Joycian googolism weirder than the googolplux, apparently using some sort of
extrapolation with Roman numerals analogous to the googo- prefix from "googolplux".
This number evaluates to:

g(g(3^2,3,10^100),1,1,2,100,10)
g(g(9,3,googol),1,1,2,100,10)
g(googol{8}2,1,1,2,100,10)
g(googol{7}googol,1,1,2,100,10)

10**100
10****.....*****100
10*******.......*******100
10*******.......*******100
10*******.......*******100
: : : :
: : : :
: : : :
: : : :
: : : :
10*******.......*******100 with googol{7}googol layers.

Pretty crazy, but nothing too impressive in googology - in fact, it’s still less
than a single step of recursion from Graham's number.

G(gagolplex) = G(10{7}10{7}100)

A rough upper bound to Joyce’s googolpluc.

The Superexpansion Range

10{{1}}10{10}10 ~ 10{{10^100}}10
(order type w+1 ~ w2)
Entries: 41

Joycian decaltrix
g(g(11,10,10),1,1,11,10,10)
This is Joyce's last attempt to define a Bowersism - here he didn't even get the
name right. The number is called the tridecatrix. Despite passing the googolplux
and googolpluc, this is nowhere close - it's upperbounded by G(10{10}10+1), or
Graham's number with a tridecal plus one layers.
How much is the tridecatrix? Well, we can have Z blocks of Z blocks of Z blocks of
Z........blocks of Z infinitely, call that A4, A4 blocks of A4 blocks of A4 blocks
of.........A4 infinitely, call that A5, then A6, A7, A8, A9.......then go
infinitely, and call that B, then continue in that manner for B and call that C,
continue infinitely.............ah fuck it, it's nowhere close. It's formed as a
dodecational array, far far beyond what we've described. It's beyond nesting levels
of nesting levels of nesting, or iterating hyper-levels or whatever mumbo jumbo.

G(10{10^12}10)

A rough lower bound to Joyce’s googolplum.

Joyce’s googolplum
g(g(g(3,3,3),2,g(2,100,10)),1,1,2,100,10)

This is Andre Joyce's largest googolism, besides the baggoogol family if you
interpret them as extrapolations from the gag- and mag- prefixes rather than the
ambiguous definitions of them Joyce gave with the g-function. A googolplum solves
to:

g(g(3^^3,2,10^100),1,1,2,100,10)
g(googol{7,625,597,484,985}googol,1,1,2,100,10)

Visually:

10**100
10****.....*****100
10*******.......*******100
10*******.......*******100
10*******.......*******100
    :        :        :        :
    :        :        :        :
    :        :        :        :
    :        :        :        :
    :        :        :        :
    :        :        :        :
    :        :        :        :
10*******.......*******100 with googol{3^^3-2}googol layers.

This is an even crazier number, but Joyce doesn't go any further with his
googolisms (besides one interpretation of the baggoogol family).

{3,3,2,2} = 3{{2}}3 = 3{{1}}3{{1}}3

This number serves as an upper-bound to all of Joyce's googolisms (except for the
baggoogol family). It's equal to three expanded to the tritriplexth.

Joycian Enneatri
g(3,3,3,3,3,3,3,3,3)

Yet another of my g-function numbers. This is between 3{{1}}3{{1}}4 and

3{{1}}3{{1}}5, and between G(G(2)) and G(G(3)).

G(G(26))

In Graham’s function, a lower-bound to Conway’s tetratri.

Conway’s tetratri
3->3->3->3

This number is a very large number mentioned in John Conway's Book of Numbers as an
example of a number larger than Graham's number. The book mainly discusses
recreational mathematics, and its the same book where he introduces his -illion
system. In his book, Conway uses a few pages to describe some very large numbers,
where he briefly discusses Knuth's up-arrows and Graham's number, and a notation of
his own called chained arrow notation.
Chain arrows are a googological notation that, like Bowers' arrays, extends on up-
arrows, but isn't quite as powerful and has some quirks of its own. I discuss it in
detail here.

Here’s how this giant number would be solved:

3->3->3->3
3->3->(3->3->2->3)->2
3->3->(3->3->(3->3->1->3)->2)->2
3->3->(3->3->(3->3)->2)->2
3->3->(3->3->(3^3)->2)->2
3->3->(3->3->27->2)->2
Note that 3->3->x->2 can be expressed in Bowers' operator notation as
3{3{3{......3{27}3....}3}3}3 with x-1 3's.
Therefore, 3->3->27->2 can be imagined as:
3^^^...^^^3
w/ 3^^^...^^^3 ^s
w/ 3^^^...^^^3 ^s
.......
w/ 3^^^...^^^3 ^s
w/ 27 ^s
where there are 26 lines
and just that number exceeds G(26)!
But the full number, 3->3->3->3 = 3->3->(3->3->27->2)->2 is represented as:
3^^^...^^^3
w/ 3^^^...^^^3 ^s
w/ 3^^^...^^^3 ^s
.......
.......
.......
.......
w/ 3^^^...^^^3 ^s
w/ 27 ^s
where there are (3->3->27->2)-1 lines
and just that is very difficult to comprehend!! Conway's tetratri is clearly a
number that leaves Graham in the dust....but we're still just getting started with
the power of Bowers' four-entry arrays!

G(G(27))

In Graham’s function, an upper-bound to Conway’s tetratri.

G(G(64))

Another common retort to Graham’s number. It's a bit better than the previous
retorts, but it's still naive as it's only one recursive step away from Graham's
number. If we want to really extend Graham’s number well we’ll need to develop an
epic notation to extend this number far far beyond Graham.
Kudi-Chan's Number
~ G(G(64)+64)
This is a number Sbiis Saibian found somewhere on the Internet as a humorous retort
to Graham's number. All I can gather about the number is that it jokingly measures
"Kudi-Chan"'s genitalia in light-years, so I call it Kudi-Chan's number. It is
defined like so (where G is Graham's number):
G^^^... ... ... ^^^G
G^^^... ... ... ^^^G
G^^^... ... ... ^^^G
:    :    :    :
:    :    :    :
  G^^^... ...^^^G
G^^^...^^^G
        G^^^^G
(with G layers)
With the popular visualization of Graham's number as:
3^^^... ... ... ^^^3
3^^^... ... ... ^^^3
3^^^... ... ... ^^^3
:    :    :    :
:    :    :    :
  3^^^... ...^^^3
3^^^...^^^3
        3^^^^3
(with 64 layers)
this number seems almost like the sequel to Graham's number. However it's really
little more than yet another salad number. G^^^^G is less than G(65), G^G^^^^GG is
less than G(66), etc, so the whole number is actually upper-bounded by G(G(64)+64),
which is itself a bit of an amusing salad number.
Corporalplex
10{{1}}corporal

This is like a corporal, but with a corporal iterations of up-arrows instead of

just 100 (in other words, the visualization has a corporal layers rather than 100).
It's ten expanded to the corporalth, and the next recursive step from a corporal.

Graatagolda-sudex
E100##100#100#2

The next step in recursion from a graatagold. In the stages used to visualize a
graatagold, this is the graatagoldth stage. It's comparable to a corporalplex.

Graatagolda-dusudex
E100##100#100#3

Mulporal
10{{2}}100 = {10,100,2,2}

Thie first of my entensions to the corporal. This number’s name comes from
multiexpansion + corporal, as it's ten multiexpanded to the hundredth. It's
comparable to Saibian's greegold.

Greegold
E100##100#100#100

This number is also a graatagolda-99-sudex. It’s name is short for greedy golden
googol.

Hyper hyper hyperfaxul / three-ex-hyper-faxul

200![3]

Continuing the hyperfaxul.

Baggoogol
mag-mag-mag-.....mag-googol (googol mags)
Andre Joyce decided to further extrapolate from mag- to give bag-x = mag-mag-mag-
mag....-mag-x (x mags), trag-x = bag-bag-bag-bag....-bag-x (x bags), etc,
continuing with Latin roots to form quadrag-, quintag-, etc. I should note that
Andre Joyce actually gives a fucked up definition of baggoogol and its relatives,
and defines them as something nowhere close to what was probably meant.
In the fast-growing hierarchy, baggoogol is about fw+2(10^100), and in Bowers'
notation it's about googol{{2}}googol.

Hypergraham
G(G(G(G(G......(G(64))...)))) (Graham's number of G's)

Hypergraham is a googolism coined by SpongeTechX of Googology Wiki, which extends

on Graham's function. It's approximately equal to 65{{2}}Graham's number in Bowers'
operator notation.

Greegolda-suthrex
E100##100#100#100#2

The next step in recursion from a greegold.

Conway's tetratet
4->4->4->4
In John Conway's book of numbers, Conway also introduces 4->4->4->4 as an example
of a very large number expressible in chain arrows (and one bigger than Graham's
number). This number, by Chris Bird's proof that compares Conway chain arrows
against Bowers' arrays, falls between 4{{3}}4 and 4{{3}}5. It's the largest number
explicitly mentioned in Conway's book.
Conway's tetratet is the fourth Conway number, a member of a sequence coined by
Conway in his book. Conway numbers are members of the sequence:
1
2->2 = 4
3->3->3 = 3^^^3 = tritri
4->4->4->4 ~ 4{{3}}5
5->5->5->5->5 ~ 5{{{4}}}6
etc.

Powporal
10{{3}}100

I like the sound of the operation used to define this number, called
powerexpansion. This number is 10 powerexpanded to 100. But we’re still far from
reaching a biggol!

Grinningold
E100##100#100#100#100

This gargantuan number is short for grinning golden googol. Saibian says it is
grinning because of how infinitesimal it makes you seem.

Four-ex-hyperfaxul
200![4]

We can easily continue the "ex-hyper" series.

Traggoogol
bag-bag-bag-.....bag-googol (googol bags)
A Joycian googolism. In the fast-growing hierarchy, this number is about
fw+3(10^100), and in Bowers' notation it's about googol{{3}}googol.

Grinningolda-sutetrex
E100##100#100#100#100#2

You can guess what suffixes there would be for the next numbers in the gugold
group.

Terporal
10{{4}}100

Here it’s important to make names sound good and pronounceable, so I’m using
terporal, which sounds much nicer than tetrporal or tetporal.

Golaagold
E100##100#100#100#100#100

Short for golem golden googol. Here “golem” refers this number being so big it has
no shape or form.
Quadraggoogol
trag-trag-trag-.....trag-googol (googol trags)
A Joycian googolism. In the fast-growing hierarchy, this number is about
fw+4(10^100), and in Bowers' notation it's about googol{{4}}googol.

Pepporal
10{{5}}100

Whatever you do, don’t sprinkle this much pepper on your pasta or whatever you
make. You will probably sneeze up a tornado or something stupid like that.

Gruelohgold
E100##100#100#100#100#100#100

This number is short for “grueling golden googol”, and Saibian calls it that
because it would take so long to count to. Of course, which -illion system would
you use? Regardless, the time wouldn’t vary at all at this scale; in fact, no
matter which units you use, the time would be almost exactly a gruelohgold.

Hexporal
10{{6}}100

After that we have a hepporal, an ocporal, an enporal, and a dekporal.

Gaspgold
E100##100#100#100#100#100#100#100

Short for *gasp* golden googol. We’re wrapping up the gugold series.

Ginorgold
E100##100#100#100#100#100#100#100

Short for ginormous golden googol. Also E100##100##8.

Gargantuuld
E100##100#100#100#100#100#100#100#100

Grand tridecal
{10,10,10,2} = 10{{10}}10
This Bowerian googolism is equal to ten expandodecated to the tenth. It first
simplifies to 10{{9}}10{{9}}10{{9}}10{{9}}10{{9}}10{{9}}10{{9}}10{{9}}10{{9}}10,
which you’ll need to simplify further and further, analogous to a tridecal - the
two numbers behave quite similarly.
Googondold
E100##100#100#100#100#100#100#100#100
Comparable to a grand tridecal.

Joycian hectatri
g(3,3,3,3,3,3,3......,3,3,3) with 100 3s

This is my last g-function number. It’s around 3{{32}}3, placing it snugly between
the grand tridecal and biggol, and just under the output of chan-2.c.
Output of chan-2.c
~ fw+47(10^39) or about 10{{47}}10^39
This is the output of chan-2.c, Tak-Shing Chan's second submission to Bignum
Bakeoff. Chan-2.c, unfortunately, produces a smaller value than chan.c, Chan's
original submission. Chan defines this number with a 2-argument function similar to
the Ackermann function that achieves growth rates of w in the fast-growing
hierarchy, and then applies 47 levels of iteration to get growth rates of w2 in the
fast-growing hierarchy. The value is far far larger than Graham's number, and is a
decent sized 4-entry array number.

Gugolthra
E100##100##100

This number ends in -thra because of the three 100s in its definition. It's
comparable to biggol. It also starts the third row in our googol extension table;
the first two were googol through googondol and gugold throughgoogondold.

Biggol
{10,10,100,2} = 10{{100}}10

This is 10 expandocentated to the 10th, a Boweria. After that, we have a baggol,

beegol, etc, which we’ll see when we get there. Those numbers are quite a long way!

Giaxul
200![200] = 200![1,2]

This number’s name means “giant faxul”. It’s an offical Hollomism equal to about
200{{199}}200. It ends the faxul series and begins its own series. It's roughly
comparable to the biggol.
The Higher-Tetrentrical Range
10{{10^100}}10 - {10,10,10,10^100} 
(order type w2+1 ~ w^2) 
Entries: 45

Corplodal 
10{{{1}}}100 = {10,100,1,3} 

This number’s name (which I made up) comes from “explosion”+”corporal”. It's equal
to 10{{10{{10......{{10}}.......}}10}}10}}10 with 100 10s from the center out. 

Graatagolthra 
E100##100##100#100 

This is comparable to corplodal. 

200![2,2] 
A HAN construction to make the notation more clear. Here's how to calculate it: 

x![1,2]=x![x] 

x![n,2]=(.....(x![n-1,2])![n-1,2]).......![n-1,2]) 

Then: 

Stage 1 = 200![1,2] = 200![200] = giaxul 

Stage 2 = giaxul![1,2] = giaxul![giaxul] 

Stage 3 = (Stage 2)![1,2] = (Stage 2)![Stage 2] 

........ 

This number is stage 200. It’s about 200{{{1}}}200 with Bowers' operator notation.

Mulplodal 
10{{{2}}}100 

From multiexplosion+corplodal. To calculate this number: 

Stage 1 = 10 

Stage 2 = 10{{10{{10{{10......{{10}}......10}}10}}10}}10 with 10 10s from the

center to one end 

Stage 3 = 10{{10{{10{{10......{{10}}......10}}10}}10}}10 with Stage 2 10s from the

center to one end 

...... 

Mulplodal is stage 100. 

Greegolthra 
E100##100##100#100#100 

Comparable to a mulplodal. 

200![3,2] 

Or (((200![2,2])![2,2])![2,2])....![2,2]). 

Bowers' Tetratri 
{3,3,3,3}=3{{{3}}}3 

This is the number Bowers calls tetratri. It's equal to 3 powerexploded to the 3rd.
Powerexplosion has a real nice ring to it, giving a sense of far-reaching glory of
the insanely large numbers. Here’s how this number is calculated: 

Stage 1 = 3 

Stage 2 = 3{{3{{3}}3}}3 (3 3’s from the center out) = 3{{x}}3, where x (that's
3{{3}}3) is: 

3^^^...^^^3 with 3^^^...^^^3 with 3^^^...^^^3 ... ... with 3^^^3 with 3 ^s 
with 3^^^...^^^3 with 3^^^...^^^3 with 3^^^...^^^3 ... ... with 3^^^3 with 3 ^s 
with 3^^^...^^^3 with 3^^^...^^^3 with 3^^^...^^^3 ... ... with 3^^^3 with 3 ^s 
        :         :         :         :         : 
        :         :         :         :         : 
with 3^^^...^^^3 with 3^^^3 with 3 ^s 

with 3^^^...^^^3 where there are 3^^^...^^^3 with 3^^^...^^^3 with

3^^^...^^^3 ... ... with 3^^^3 with 3 ^s, where there are 3{tritri}3 steps steps.
And that’s just the number within the double curly brackets! 

As you can see stage 2 is alreardy SCARY!!! But it pales in comparison to stage 3: 

Stage 3 = 3{{3{{3{{3.......{{3}}........3}}3}}3}}3 (Stage 2 3s from the center

out) 

THAT’S INSANE!!!! But it’s still much less than Stage 4: 

Stage 4 = 3{{3{{3{{3.......{{3}}........3}}3}}3}}3 (Stage 3 3s from the center

out) 

... and so on ... continue to Stage 100, stage googol, stage googolplex, stage
tritri, stage tritriplex, stage 3{{2}}3, stage 3{{3}}3, stage 3{{3{{3}}3}}3 ... ...
... 

Are you ready? Tetratri is Stage Stage 3 - Mother of God it's HUGE!!! Graham's
number seems quite modest now, doesn't it? But this is still rather small amongst
the googolisms, as even Conway chain arrows are enough to approximate this
number ...

Among Saibian's googolisms the falls between greegolthra and grinningolthra. 

Powplodal 
10{{{3}}}100 

10 powerexploded to the 100th. 

Grinningolthra 
E100##100#100#100#100 

5->5->5->5->5 

This is the fifth Conway number (see 4->4->4->4 for more), a Conway chain of five
fives. It is not explicitly named by Conway but it is still a valid construction.
The value is comparable to 5{{{4}}}6 in Bowers' operator notation. 

Terplodal 
10{{{4}}}100 

We can continue this series of numbers with pepplodal, hexplodal, then hepplodal,
ocplodal, ennplodal, and dekplodal. 

Golaagolthra 
E100##100##100#100#100#100#100 

Upper bound of output of chan-3.c 

~ fw2+4(199,999) or 10{{{4}}}200,000 

Chan-3.c is Chan's third submission to Bignum Bakeoff - here, Chan starts off with
a 3-argument function similar to previously, but this time he extends with two
functions that use complicated recursion to iterate each other, achieving growth
rates in the ballpark of w2+4 in the fast-growing hierarchy. 

Gruelohgolthra 
E100##100##100#100#100#100#100#100 

Gaspgolthra 
E100##100##100#100#100#100#100#100#100 

Ginorgolthra 
E100##100##100#100#100#100#100#100#100#100 

Gargantuulthra 
E100##100##100#100#100#100#100#100#100#100#100 

Googondolthra 
E100##100##100#100#100#100#100#100#100#100#100#100 

The end of the third row of extended Hyper-E numbers. Now on to: 

Gugoltesla 
E100##100##100##100 

Not to be confused with an electric car company. It is the start of the fourth row
of Saibianisms, and is also comparable to baggol. 

Baggol 
{10,10,100,3} = 10{{{100}}}10 

Or 10 explodocentated to the 10th. Another 4-entry array Bowersism.

200![1,3] 

Or 200![200,2]. In hyperfactorial arrays (like in Bowers' arrays), the later

entries clearly matter more than the earlier ones, and that effect is only more
profound with larger arrays. 

Cordetal 
10{{{{1}}}}100 

Or 10 detonated to the 100th. Once again, I named this number. Here are some more
numbers we can name: 

Muldetal 
Powdetal 
Terdetal 
Pendetal 
Hexdetal 
Hepdetal 
Ocdetal 
Enndetal 
Dekdetal 

Graatagoltesla 
E100##100##100##100#100 

Here are some more numbers that we can name:

Greegoltesla 
Grinningoltesla 
Golaagoltesla 
Gruelohgoltesla 
Gaspgoltesla 
Ginorgoltesla 
Gargantuultesla 
Googondoltesla 

Supertet 
{4,4,4,4}=4{{{{4}}}}4 

These numbers are getting more and more outrageous by the minute. A supertet can be
computed like so: 

Stage 1 = 4

Stage 2 = 4{{{4{{{4{{{4}}}4}}}4}}}4 - note that the number inside the triple

braces, 4{{{4}}}4, is MONSTROUSLY LARGER than 3{{3}}3 - hell, it's FUCKING
UNFATHOMABLY BIGGER than even a tetratri! And that's merely the second step! 

Stage 3 = 4{{{4{{{4{{{4.......{{{4}}}........4}}}4}}}4}}}4 (Stage 2 4s from the

center out) - hold on, don't scream yet 

Stage 4 = 4{{{4{{{4{{{4.......{{{4}}}........4}}}4}}}4}}}4 (Stage 3 4s from the

center out)

etc.

Now continue with stage 5, 6, 7, 8, 9, 10.....100....1000.....stage googol,

googolplex, giggol, tritri, tridecal, boogol, biggol, tetratri..........stage stage
2, stage stage 3, stage stage 4...........then go to stage x, where x is stage y,
where y is stage 4 - that's the horrifyingly huge stage stage stage 4!! 
But that ISN'T EVEN CLOSE to supertet. Imagine it like so:

Super-Stage 1 = 4

Super-Stage 2 = Stage Stage Stage 4 - that's the number described previously

Super-Stage 3 = Stage Stage Stage Stage...........Stage Stage 4 with (Super-Stage

2) - 1 stages

Super-Stage 4 = Stage Stage Stage Stage...........Stage Stage 4 with (Super-Stage

3) - 1 stages - THAT is a supertet......feel free to scream now!!!

This number will easily be humbled by EVEN MORE GIGANTIC numbers!

Gugolpeta
E100##100##100##100##100

Starting the fifth row of extended Hyper-E numbers.

Beegol
10{{{{100}}}}10

Not to be confused with a dog, as Bowers says on his website. This is ten
detonocentated to the tenth.

200![1,4]

In general, a![b,c] ~ {a,a,b-1,c+1}. 200![1,4] is also equal to 200![200,3], so

this is about 200{{{{199}}}}200.

Corpental
10{{{{{1}}}}}100

Here’s some more numbers:

Mulpental
Powpental
Terpental
Peppental
Hexpental
Heppental
Ocpental
Ennpental
Dekpental

Gugolhexa
E100##100##100##100##100##100 or E100###6

Bigol
10{{{{{100}}}}}10 = {10,10,100,5}
10 pentonohectated to the tenth.

200![1,5]

Corhexal
10{61}6100

Related numbers include:

Mulhexal
Powhexal
Terhexal
Penhexal
Hex-hexal
Hephexal
Ochexal
Ennhexal
Dekhexal

Corheptal
Mulheptal
Powheptal
Terheptal
Penheptal

Coroctal
Corennal
Cordekal

You may notice that 10{x5}x100’s names can start pen- or pep-. Here’s the general
rule: if the middle syllable starts with a p, you say pep-. Otherwhise, you say
pen-.

Gugolhepta
E100##100##100##100##100##100##100

Boggol
{10,10,100,6}

Jonathan Bowers says about this number, “boggles the mind, doesn’t it?”

Gugolocta
E100##100##100##100##100##100##100##100

Bagol
{10,10,100,7}

Bowers says about this number, “whatever you do, don’t eat this many bagels”. Just
imagine...
Gugolenna
E100###9

General/tetradecal
{10,10,10,10}

In Bowers' operator notation, this is equal to 10{{{{{{{{{{10}}}}}}}}}}10. Solving

this would take 10 levels of decomposing the curly bracket groups before we hit the
number. The old man is getting a little tired from solving all those numbers, but
they’re still quite easy. Just imagine how huge it is!

Gugoldeka
E100###10

This was originally a number found in a hidden article of Saibian's (see grand
throogol), but now it's a public Saibianism. It expands to
E100##100##100##100##100##100##100##100##100##100, and is used as an upper bound to
a general.
Gargantuuldeka
E100##100##100##100##100##100##100##100##100##100#100#100#100#100#100#100#100#100#1
00

The largest possible Extended Hyper-E number using ## and # (about {10,100,9,10} in
BEAF), but there’s still a lot more.
Output of pete-4.c
~ fw33(100,000) or about {10,10,100000,33}
This is the output of Pete's fourth submission in Bignum Bakeoff - here, he uses a
3-argument function based on exponentiation that achieves growth rates of w^2, the
same level of power of Conway chained arrow notation and Bowers' four-entry arrays.
It's much larger than his third, eighth, and ninth submissions, but much less than
his far larger fifth, sixth, and seventh submissions.
Output of chan.c
~ fw50(100,000) or about {10,10,100000,50}
This number is the output of Chan's first submission in Bignum Bakeoff. Here, he
defines a 3-argument recursive function and uses further recursion that's more
powerful than in his next attempts. Like pete-4.c, he achieves growth rates of w^2.

Throogol
E100###100

This crazy number is short for “third googol”. It starts the second table of Hyper-
E numbers, beginning with throogol and ending with thrinorgolocta. The second table
would go behind out first table, starting the third dimension. When we get to
E100####100 we’ll need to go through higher dimensions. This number is comparable
to and slightly smaller than a troogol.

Troogol
{10,10,10,100}

Or
10{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{
{{{{{{{{{{{{{{{{{{{10}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}
}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}10 in full. That’s 100 pairs of { }! Solving
this number would require a hundred levels of decomposition! These numbers are
getting more and more outrageous, and by now we've neared the breaking point of
Conway chained arrow notation - this is comparable to a chain of 100 tens.

Giabixul
200![200,200]

This can also be written as 200![1,1,2], and it's about {200,200,199,201}. The next
official Hollomism, giatrixul, is much much larger.
Hollom's hyperfactorial arrays are actually a lot more complicated than they seem,
and something that really would take a whole article to even discuss. The arrays
are more powerful than Bowers' idea because a different, more complex, approach is
taken, reaching growth rates of φ(w,0) in the FGH instead of just w^w.

The Pententrical Range

{10,10,10,10^100} - {10,10,10,10,10^100}
(order type w^2+1 ~ w^3)
Entries: 39

Grand throogol
E100###100#2 = E100###throogol
This number is equal to E100##100##100##100......##100 with throogol 100’s. It is
the next step in recursion after a throogol.
Troogolplex
{10,10,10,troogol}

Or 10{{{{{.....{{{{10}}}}.....}}}}}10 with a troogol pairs of { }. This number

needs a troogol levels of decomposition! But it's still comprehensible recursion,
so in a sense we're still yet to reach the real whoppers.

Fish number 1
~ fw^2+1(63)
Fish number 1 is the smallest googolism of Kyodaisuu of Googology Wiki. It was
defined by him on 2ch.net in 2002, using an extension of the Ackermann function,
which is discussed in part 1 and earlier in part 3. Kyodaisuu said that what he
knew about googology at the time was only the Ackermann function and Graham's
number, and he decided to combine elements from both to get this number. The
extension to the Ackermann function Kyodaisuu used order type w^2, the same power
of chained arrow notation. by iterating it, we reach order type w^2+1. Therefore
this number falls just below a thrangol, which is about fw^2+1(100).

Thrangol
E100###100#100

From throogol + grangol. You can see we’re recycling old number names now.
BOX_M~
Approximately fw^2+1(G(G(64)))
This number was coined by Marco Ripa in January 2012, which was naively thought by
him to be the largest named number. It is defined as follows:
n = GL (xL is defined later, and G is Graham's number)
n$ = (n!)^^(n!)
nY = ((n$)^^(n$))^(((n-1)$)^^((n-1)$)).....^((2$)^^(2$))^((1$)^(1$)) (note:
supposed to be the yen sign, but I used Y as an ASCII substitute)
nL = ((nY)^^(nY))^(((n-1)Y)^^((n-1)Y)).....^((2Y)^^(2Y))^((1Y)^(1Y)) (note:
supposed to be the pound sign, but I used L as an ASCII substitute)
A1 = nL, Ak = (A(k-1))^^(A(k-1))
Mk(a) = a{{1}}(k+1)

k1= MnL(AnL)!

kn = n{k(n-1)}n

R~ = kkkkk.....kGL, where G is Graham's number (the tilde is on top of the R, but

doesn't work in ASCII)

M~1 = (GL{R~}GL) -> (GL{R~}GL) -> (GL{R~}GL) ..... -> (GL{R~}GL), with GL{R~}GL
horizontal arrows in chained arrow notation

M~k = (M~(k-1)) -> (M~(k-1)) -> (M~(k-1)) ..... -> (M~(k-1)) with M~(k-1)
horizontal arrows (the tilde is on top of the M, but that doesn't work in ASCII)

BOX_M~ = M~(M~1+1)
This whole number, as it turns out, is a very sloppy salad number, as seasoned
googologists are sure to notice. It throws in so many gratuitous factorials and
mishmashes a variety of popular notations, rather than making an original notation
beyond a simple set of sequences that each build upon the previous with a totally
random step. What's weird about this number is it was created by the founder of an
Italian high-IQ society, who once wrote a book about the hyper-operators, but it's
exactly the kind of number googologists laugh at. I'd expect a guy like this to do
better. I think this serves to show how obscure of a field googology is, with its
ways as natural as can be to those who know it but completely misunderstood by the
majority of people.

Threagol
E100###100#100#100

From throogol + greagol. You can see where this is going...

Thrigangol
E100###100#100#100#100

Throrgegol
E100###100#100#100#100#100

Thrulgol
E100###100#100#100#100#100#100
Thraspgol
E100###100#100#100#100#100#100#100

Thrinorgol
E100###100#100#100#100#100#100#100#100
Thrargantuul
E100###100#100#100#100#100#100#100#100#100
Throogondol
E100###100#100#100#100#100#100#100#100#100#100

Thrugold
E100###100##100

Thraatagold
E100###100##100#100

3 #s, then 2, then 1, This number has a neat construction.

Thrugolthra
E100###100##100##100

Thrugoltesla
E100###100##100##100##100

Thrinorgolocta
E100###100##100##100##100##100##100##100##100##8

The largest Hyper-E number before E100###100###100 - now there are 200 possible
number names.

How about...

Throotrigol
E100###100###100

This is the next extension to a throogol once we exhaust the ones directly based on
the googol, gugold, and gugolthra series. It’s comparable to triggol.

Triggol
{10,10,10,100,2}

Yep. That much between a troogol and a triggol.

Thrantrigol
E100###100###100#100

Threatrigol
E100###100###100#100#100

Thrutrigold
E100###100###100##100
Pentatri
{3,3,3,3,3}
A pentatri is a horrendously huge number equal to a linear array of five threes.
It's mind-crushingly larger than a tetratri, and mind-crushing to imagine the
computation - it's too complex to really understand! In terms of Aarex's extension
to Bowers' hyper-operator names, a pentatri is equal to three powergigoexploded to
the third.

Thrutrigolthra
E100###100###100##100##100

Throotergol
E100###100###100###100

To name every potential number here, just infix -ter- in any number from a throogol
to a throogondoldeka.

Traggol
{10,10,10,100,3}

Throopetol
E100###100###100###100###100
This name drops the "g" from throogol because throopetgol is awkward to pronounce.

Treegol
{10,10,10,100,4}

Whatever you do, don’t even think about planting this many trees.

You can guess what a trigol, troggol, and tragol are and what they’re comparable
to.

Superpent
{5,5,5,5,5}

This is the next super-x number. It’s also equal to {5,{5,{5,

{5,5,4,5,5},4,5,5},4,5,5},4,5,5}, which will get complicated quickly when we try to
solve it. More visual representations would help us, but there’d be too many to
directly list. In terms of Aarex's hyper-operators, this number is five
pentapetopentonated to the fifth.

Throohexol
E100###100###100###100###100###100

Throoheptol
E100###100###100###100###100###100###100

Throogogdol
E100###100###100###100###100###100###100###100
Throogentol
E100###100###100###100###100###100###100###100###100

Pentadecal
{10,10,10,10,10}

Throodekol
E100###100###100###100###100###100###100###100###100###100
The highest possible throogol number is throogondekoldeka. Now on to...
Fish number 2
~ fw^3(63)

Later in 2002, Kyodaisuu discovered more googology, such as Chris Bird's array
notation. To compete better with that, he extended Fish number 1's system to reach
order type w^3 in the fast-growing hierarchy, and came up with this number. It
falls just below a teroogol, which is about fw^3(99).

Tetroogol
E100####100

This number is also known as the fourth googol and is comparable to quadroogol, but
the prefix tera- is used for convenience. It begins the second cube of numbers and
starts to go four-dimensional in the hyper-grid of Hyper-E numbers.
Quadroogol
{10,10,10,10,100}

First we have a googol, then a boogol, then a troogol, then this. This number is
horrendously big and is starting to get a bit harder for the old man. But it’s
still doable, but pretty ... damn ... tiring.

The Higher-Linear-Array Range

{10,10,10,10,10^100} - {10,99(1)2}
(order type w^3+1 ~ w^w)
Entries: 40
Quadroogolplex
{10,10,10,10,quadroogol}

The next step in recursion for a quadroogol.

Tetrangol
E100####100#100
Time to skim through the tetroogol series.

Tetreagol
E100####100#100#100

Tetrugold
E100####100##100

Tetrugolthra
E100####100##100##100

Tetraatagolthra
E100####100##100##100#100

This is Sbiis Saibian's 2000th googolism in his multi-part list of Extensible-E

numbers. It's approximately {10,100,1,3,1,2} using Bowers' array notation.
Tetrithroogol
E100####100###100

This is a neat trick we’ll be using to name higher Hyper-E numbers.

Tetrithrangol
E100####100###100#100

Tetrithrootrigol
E100####100###100###100

Now we can have the first two cubes named. The first cube will have the googol
series and the gugol/gugolthra series in its first plane, the throogol series in
its second, the throotrigol series in its third, etc. The second cube will have
tetroogol to tetrinorgolocta in its first plane, tetrithroogol to
tetrithrinorgolocta in its second, the tetrthrootrigol series in its third, etc.

Quadriggol
{10,10,10,10,100,2}

Quadraggol, quadreegol, etc. should be obvious.

Tetrootrigol
E100####100####100
Once again, recycling an old trick for the throogol series. This number starts the
third cube and is comparable to quadriggol.
Tetrootrithroogol
E100####100####100###100
Tetrootergol
E100####100####100####100
The largest possible tetroogol series number would be
tetroogogogdithroogongodgoldeka. The number names are getting crazy.

Tetroopetol
E100####100####100####100####100
Superhex
{6,6,6,6,6,6}

A linear array of six sixes.

Tetroodekithroogondekugoldeka
E100####100####100####100####100####100####100####100####100####100###100###100##
#100###100###100###100###100###100###100##100##100##100##100##100##100##100##100##
100#100#100#100#100#100#100#100#100#100
The largest possible teroogol series number.
Pentoogol
E100#####100
This is where the megacube of numbers hits the 5th dimension. A few sample
pentoogol numbers are coming up. By the way, this is comparable to quintoogol.
Quintoogol
{10,10,10,10,10,100}
The outrageousness is almost unbearable now. It’s starting to become a challenge
for the old man to solve these numbers.
Pentangol
E100#####100#100
Pentuelohgoltesla
E100#####100##100##100##100#100#100#100#100#100
Pentithroogol
E100#####100###100
Pentitetrithroopetangol
E100#####100####100###100###100###100###100#100#100#100

From a googol to the pentoogol group, 100,000 Hyper-E numbers can be named.
Pentolaahexold
E100#####100#####100#####100#####100#####100##100#100#100#100#100
These numbers are but a few of these many possibilities.
Supersept
{7,7,7,7,7,7,7}

A linear array of seven sevens.

Hexoogol
E100######100
This number is comparable to sextoogol and is where the “Hyper-E-Grid” becomes 6-
dimensional. It's not to be confused with sextoogol.
Sextoogol
{10,10,10,10,10,10,100}

Superoct
{8,8,8,8,8,8,8,8}

A linear array of eight eights.

Heptoogol
E100#######100
Also called the seventh googol. Not to be confused with septoogol.
Septoogol
{10,10,10,10,10,10,10,100}

Superenn
{9,9,9,9,9,9,9,9,9}

A linear array of nine nines.

Ogdoogol
E100########100
Once was the last simple Hyper-E number, so to speak. But recently Sbiis Saibian
coined some extra Hyper-E googolisms after this.
Octoogol
{10,10,10,10,10,10,10,10,100}
The last number of Bowers’ prime googol series. The next extensions will move into
planar arrays.
Ogdiheptihexipentitetrithroogol
E100########100#######100######100#####100####100###100
This number is directly mentioned on Saibian’s website as an example of how many
different numbers can be named with his system. How about:
Ogdatrihexapentateritetrapetithrinortrigolthra
E100########100########100######100#####100#####100#####100####100####100####100
####100###100###100##100##100#100#100#100#100#100#100#100
Ditto.
Entoogol
E100#########100

The "ninth googol".

Iteral
{10,10,10,10,10,10,10,10,10,10}
This Bowerian googolism is ten tens in a linear array, a number near the breaking
point of linear arrays.

Dektoogol
E100##########100

This number is comparable to an iteral and is the last milestone Hyper-E number.

Dektadekientadekiogdadekiheptadekihexadekipentadekitetradekithrooogondekoldeka
E100##########100##########100##########100##########100##########100########
##100##########100##########100##########100#########100#########100#########
100#########100#########100#########100#########100#########100#########100###
#####100########100########100########100########100########100########100####
####100########100#######100#######100#######100#######100#######100#######100
#######100#######100#######100######100######100######100######100######100###
###100######100######100######100#####100#####100#####100#####100#####100#####1
00#####100#####100#####100####100####100####100####100####100####100####100####1
00####100###100###100###100###100###100###100###100###100###100##100##100##100##10
0##100##100##100##100##100#100#100#100#100#100#100#100#100#100

This is the largest possible Hyper-E number. It’s as crazy as it looks. In total,
10,000,000,000 (formerly 16,777,216) such numbers can be named, as mentioned in
part 2. Now on to bigger and better numbers

Output of pete-5.c
~ fw^11+16(1000) or about {1000,1000,1,1,1,1,1,1,1,1,1,1,1,17}

This is Pete's fifth submission to Bignum Bakeoff, far larger than his previous two
submissions. Here, he uses the a function that can have any number of arguments
that achieves growth rate of w^w, the same growth rates of Bowers' linear arrays!
The value is comparable to a 14-entry array, making it much more than an iteral but
much less than an ultatri.

Output of pete-6.c
~ fw^23(10^3011)

This is Pete's sixth submission to Bignum Bakeoff. It uses the same system as pete-
5.c but with a different value of the function. In terms of Bowers' arrays, this
number is comparable to a 25-entry array of 10^3011s.
Ultatri
{3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3} = {3,27(1)2}

Another official Bowersism, and the last one before we hit the 2-row array numbers.
Just imagine trying to solve this - it's a linear array of 27 threes. In Bowers'
old array notation, this number showed up again and again when working with
dimensional arrays of threes, because it was equal to {3,3,3........3} with {3,3,3}
threes.

We've exhausted linear arrays now - welcome to the next level of array notation,
dimensional arrays - now we'll encounter dimensional arrays and similarly powerful
notations in part 5.
PART 5: THE HIGHER GIANTS
order type w^w to Γ0
Things get really crazy here with huge numbers too big to represent with large
number notations of order type w^w like a xappol, a gongulus and a tethrathoth -
some preliminary knowledge of googological notations is HIGHLY recommended.

The Two-Row-Array Range

{10,100(1)2} ~ {10,99(1)(1)2}
(order type w^w ~ w^(w2))
Entries: 78

Goobol
{10,10,10......10} with 100 10s or {10,100(1)2}

A goobol is a linear array of 100 tens. It's the next of Bowers' googol extensions,
and the smallest of his dimensional array googolisms (though this can still be
written out using linear arrays). It's a good starting point for dimensional
arrays.

Godgahlah
E100####......####100 with 100 #s or E100#^#100

This number is the end of Hyper-E and the beginning of Cascading-E, and was created
before Cascading-E was invented. It can be written E100#^#100 in Cascading-E, and
its name has a sense of far-reaching glory, unlike the goobol, a comparable
googolism.

Giatrixul
200![200,200,200]

Roughly equal to a linear array of 202 200’s. The next official HAN number
(giaquaxul) will take a very long time for us to reach.

Godgahlahgong
E100,000#######........#######100,000 with 100,000 #s or E100,000#^#100,000

This is the gong version of a godgahlah. It has even more of a glorious sense than
the godgahlah.

Googahlah
E100##########..............#######100 with 10^100 #s or E100#^#(E100)

This is a special googolism by Sbiis Saibian, like a godgahlah but with a googol #s
- that chain of #s would reach all the way through the observable universe and way
beyond. This number is comparable to a linear array of a googol 100's.

Output of pete-7.c
~ fw^w(2^^35)

This number is the largest entry submitted by Pete in Bignum Bakeoff. Here, he uses
the system in pete-5.c and pete-6.c, but extends it to calculate with arbitrary
numbers of arguments. Here, Pete gives the function a tetrational number of
arguments, creating a number comparable to a 2^^35-entry array. The number is much
larger than a godgahlahgong but falls short of a dupertri.

Pete-7.c fell in third place in Bignum Bakeoff - the second place entry reaches
past epsilon zero in the fast-growing hierarchy and the first place entry is so
large that we don't know how to represent it in the fast-growing hierarchy!

Dupertri
{3,3,3...3} with tritri 3’s or {3,tritri(1)2} or {3,3,2(1)2}

This number is a very low-level two-row array, a linear array of tritri threes.
There will be plenty of 3-based Bowersisms coming your way. Their decimal
expensions all end in the same way Graham’s number ends.

Iteralplex/duperdecal
{10,10,10....10} with iteral 10’s or {10,iteral(1)2}

A linear array of an iteral tens. This can also be written {10,3,2(1)2}.

Goobolplex
{10,10,10........10} with goobol 10’s or {10,goobol(1)2}

As glorious as this seems, we will be really taking this a lot further than plain
old recursion.

Grand godgahlah
E100##########...................#########100 with godgahlah #s or E100#^#100#2

This is the next step in recursion from a godgahlah. It's comparable to a

goobolplex.

Grand godgahlahgong
E100,000#############.......................#################100,000 with
godgahlahgong #s or E100,000#^#100,000#2

This number, as stated by Saibian, has a real nice ring to it, bringing a sense of
far-reaching glory like a googolgong once had for Sbiis

Truperdecal/iteralduplex
{10,duperdecal(1)2}

Grand grand godgahlah

E100#grand godgahlah100 or E100#^#100#3

This number can also be called "two-ex-grand godgahlah", although that doesn't
really shorten the name.
Grand grand godgahlahgong
E100,000#grand godgahlahgong100,000 or E100,000#^#100,000#3

This feels like we’re really putting loads and loads of improvement over the
godgahlah ... but it’s still barely scratching the surface of Cascading-E! It was
at one point the largest number on Sbiis Saibian's large number list.

Grand grand grand godgahlah / Three-ex-grand-godgahlah

E100#^#100#4

Grand grand grand grand godgahlah / Four-ex-grand godgahlah

E100#^#100#5

Gibbol
{10,100,2(1)2}

Stage 1 is 10. Stage 2 is {10,10,10,10,10,10,10,10,10,10} (iteral). Stage 3 is

{10,10,10,10,10.......,10,10,10} with stage 2 10s. Keep going and a gibbol is stage
100. This still isn't much further recursion from a goobol though

Grandgahlah
E100#^#100#100

Also known as 99-ex-grand godgahlah, and comparable to gibbol. It’s the first new
number defined with Cascading-E, as the previous godgahlah-based numbers were
already created before Cascading-E.

Googol-ex-grand godgahlah
E100#^#100^(googol+1)

Googolplex-ex-grand godgahlah

Grangol-ex-grand godgahlah

Greagol-ex-grand godgahlah

Gigangol-ex-grand godgahlah

Gugold-ex-grand godgahlah

Saladgahlah
[[(E100#^#100#(G(64)+1))^^(10^100,000,000,000,000,000))!
2[2[5]]]^[(E100#^#100#(G(64)+1))^^(10^100,000,000,000,000,000))!2[2[5]]]]{9001}
[[(E100#^#100#(G(64)+1))^^(10^100,000,000,000,000,000))!
2[2[5]]]^[(E100#^#100#(G(64)+1))^^(10^100,000,000,000,000,000))!2[2[5]]]]

This number is psychedelically huge, which can be obtained in the following

process: first you take a Graham’s-number-ex-grand godgahlah, and then make a power
tower of 1 followed by 100 quadrillion zeroes of that number, and then take its
factorial, then take that number’s factorial, then take THAT number’s factorial,
continue Moser's number of times! After that take the number to the power of
itself! Finally, go and take that number, 9001 up-arrows, and that number again,
and evaluate that! That is the saladgahlah!

Nah... just kidding. This number is an example of a salad number, which I coined
just for the hell of it and also as a number a naive googologist may come up with.
What is a salad number, you may ask? It’s a number defined with a ridiculous number
of inelegant steps in an attempt to be majestically large. These numbers are most
often created by inexperienced googologists, who think that by combining a lot of
different functions they’d get an amazingly huge number. This doesn’t work because
to get anywhere, you need to define whole new functions, as old functions will
always become obsolete at one point or another. In fact, Graham's-number-ex-grand
godgahlah is so large that all the operators applied to it here have no real
effect, so this number is only between gugold- and graatagold-ex-grand
godgahlah. So much for a crazy hierarchy of steps.
Hell, even if they aren't familiar with the concept of salad numbers, people can
generally intuitively recognize numbers like this as sloppy. Moving on...

Graatagold-ex-grand godgahlah

Gugolthra-ex-grand godgahlah

Gugoltesla-ex-grand godgahlah

Throogol-ex-grand godgahlah

Tetroogol-ex-grand godgahlah

Dektoogol-ex-grand godgahlah

Godgahlah-ex-grand godgahlah

As impressive as this sounds, it’s still a naive extension, since it's only one
generation of recursion.

Latri
{3,3,3(1)2} = {3,3(1)3}

Stage 1 = 3
Stage 2 = {3,3,3} = Tritri
Stage 3 = {3,3,3.......3} with tritri 3’s = dupertri
Stage 4 = {3,3,3,3...........3} with stage 3 3’s
...
Latri is Stage Stage 3.
Latri is notable for being the smallest non-degenerate non-linear array that can be
expressed with Bowers' array of operator - in this case, it's 2+1 & 3, since a+b &
x is {x,x,x.....x,x,x(1)x,x,x,x......x.x,x} with a x's before (1) and b x's before
(1).

Grand godgahlah-ex-grand godgahlah

Grand grandgahlah / grandgahlah-minus-one-ex-grand godgahlah

E100#^#100#2

Grandgahlah-ex-grand godgahlah

Godgahlah-ex-grand godgahlah-ex-grand godgahlah

Despite this sounding like the potential next level, this is not where we’ll be
going from here.

Gabbol
{10,100,3(1)2}

If you go back to the gibbol stages, this number is stage stage stage ... ... stage
1, with 100 stages.

Greagahlah
E100#^#100#100#100

A bit better than grandgahlah and comparable to gabbol, but still recycling old
operators. If we want to go anywhere we’ll need to define new operators. This is
99-ex-grand godgahlah-ex-grand godgahlah-ex-grand ... ... godgahlah with 100
godgahlahs.

Geebol
{10,100,4(1)2}

Gigangahlah
E100#^#100#100#100#100

Gorgegahlah
E100#^#100#100#100#100#100

Gulgahlah
E100#^#100#100#100#100#100#100

Gaspgahlah
E100#^#100#100#100#100#100#100#100

Ginorgahlah
E100#^#100#100#100#100#100#100#100#100

Boobol
{10,10,100(1)2}

Gugoldgahlah
E100#^#100##100

Comparable to a boobol.

Bibbol
{10,10,100,2(1)2}

Gugolthragahlah
E100#^#100##100##100

Troobol
{10,10,10,100(1)2}

Throogahlah
E100#^#100###100

Quadroobol
{10,10,10,10,100(1)2}

Yottoogahlah
E100#^#100########100

Gootrol
{10,100(1)3}
Quite a bit better than the previous attempts, this number is to goobol as goobol
is to googol.

Gotrigahlah
E100#^#100#^#100

Slightly better, but here we hit a problem. Instead of recycling old operators we
are still just reusing our fresh operators. We’ll need to define new operators
along the way if we want to get anywhere. This number is comparable to gootrol. Its
order type in the fast-growing hierarchy is twice that of a godgahlah.

Gitrol
{10,100,2(1)3}

Here are some more numbers:

Gatrol
Geetrol
Gietrol
Gotrol
Gaitrol
Bootrol
Trootrol
Quadrootrol

Grangotrigahlah
E100#^#100#^#100#100

Of course, after that we can have a greagotrigahlah, a gugoldgotrigahlah, a

gugolthragotrigahlah, a throogotrigahlah, a tetroogotrigahlah, and so on.

Gooquadrol
{10,100(1)4}

We can coin a series of -quadrol numbers, as well as -quintol, -sextol, -septol,

etc.

Gotergahlah
E100#^#100#^#100#^#100

Comparable to gooquadrol. You can add a root of a Hyper-E number right before the
name to create ten billion different numbers.

Gopeggahlah
E100#^#100#^#100#^#100#^#100 = E100#^#*#5

In general Ea@*#b (where a is any delimiter such as #^#) is Ea@a@a@a....@a with b

a's. #*# can actually simplify to ##, since multiple #s in a row are interpreted as
a product of #s. Here are some more numbers:

Gohexgahlah
Gohepgahlah
Go-ahtgahlah
Go-enngahlah
Godekahlah

Emperal
{10,10(1)10}
This googolism solves to {10,10,10,10,10,10,10,10,10,10(1)9}. To solve this you
would need to decompose this into { ... ... ... (1)8}, and then that to
{ ... ... ... ... ... ... ... (1)7} until we get a huge linear array. Yikes! This
is comparable to godekahlah.

Gossol
{10,10(1)100}

Evaluates to {10,10,10,10,10,10,10,10,10,10(1)99}.

Godgoldgahlah
E100#^#*#100

Or E100#^#100#^#100#^#100..........#^#100 with 100 100’s. This number’s name makes

sense because it is analogous to a gugold (E100#100#100.......#100 with 100 100’s)
compared to the googol (E100).

Gotrigoldgahlah
E100#^#*#100#^#*#100

This number is comparable to a gissol and also can be written as E100#^#*##3.

Gissol
{10,10(1)100,2}

Gotergoldgahlah
E100#^#*##4

Comparable to gassol.

Gassol
{10,10(1)100,3}

Geesol
{10,10(1)100,4}

Gussol
{10,10(1)100,5}

Hyperal
{10,10(1)10,10}

This number can also be written as:

/10,10\
\10,10/.

It's a 2x2 array of tens, which can also be called a 2+2, 2^2, 2^^2, etc. array of
10s. It evaluates to {10,10,10,10,10,10,10,10,10,10(1)9,10}.

Fish number 3
~ fα(63), where α = (ww+1)*63+1

This is the next of the Fish numbers, coined in 2002. It's a big jump from the
previous, transcending Bowers' linear arrays and beginning dimensional arrays. It
uses a function called s(n) mapping that reaches w^w in the fast growing hierarchy
(the power of linear arrays), and then extends upon it to get a function that
reaches low level dimensional arrays. In terms of Bowers' notation, it's about
{63,63(1)2,63}.

Fish number 4 applies that idea to the busy beaver function, creating an
uncomputable number. However, the next Fish number in numerical order, Fish number
5, uses a different system that reaches epsilon-zero in the fast-growing hierarchy.

Mossol
{10,10(1)10,100}

Evaluates to {10,10,10,10,10,10,10,10,10,10(1)9,100}.

Godthroogahlah
E100#^#*##100

Solves to E100#^#*#100#^#*#100#^#*#100.........#^#*#100 with 100 100’s. This is

comparable to mossol.

Missol
{10,10(1)10,100,2}

Bossol
{10,10(1)10,10,100}

Godtetroogahlah
E100#^#*###100

Comparable to bossol.

Trossol
{10,10(1)10,10,10,100}

Godpentoogahlah
E100#^#*####100

Goddektoogahlah
E100#^#*#^#9

Diteral
{10,10(1)(1)2} = {10,10,10,10,10,10,10,10,10,10(1)10,10,10,10,10,10,10,10,10,10}

This evaluates to:

/10,10,10,10,10,10,10,10,10,10\
\10,10,10,10,10,10,10,10,10,10/.

Right around the limit of 2-row arrays. Now on to higher-level planar arrays!

The Planar-Array Range

{10,100(1)(1)2} - {a,b(2)2}
(order type w^(w2) ~ w^w^2)
Entries: 25

Dubol
{10,100(1)(1)2}
Or
/10,10,10,10.........10\
\10,10,10,10.........10/ with 100 10s in each row. Yikes! This number is the start
of 3-row arrays. By the way, (2) means move to the next plane, and {a,b(2)c} =
{a,b(1)(1)(1)(1)........(1)c-1} with b (1)s, or a b*b array of a’s with c-1 behind
the first a.
Also, note how for the low and high bound of the number range I’m using variables.
This is because strict limits don’t feel right and I want the limit to just be a
number expressible in the way shown. It also makes sense to use order types in the
fast-growing hierarchy, because it's a very common way to approximate
googologically large numbers.
Deutero-godgahlah
E100#^#*#^#100
This number is comparable to dubol, and not too far from E100#^##100. Now we’re
really starting to get somewhere with our godgahlah extensions.
Dutrol
{10,100(1)(1)3}
Deutero-gotrigahlah
E100#^#*#^#100#^#*#^#100
Comparable to dutrol.
Admiral
{10,10(1)(1)10}
This is comparable to deutero-godekahlah, another military-themed Bowerian
googolism.
Dossol
{10,10(1)(1)100}

Deutero-godgoldgahlah
E100#^#*#^#*#100

If we want to go anywhere we’ll need new delimiters (#....# expressions)

altogether, like we’re doing. This number is comparable to dossol.

Cyperal
{65,googolplex(1)1000,googol(1)7quadragintiquingentillion,42}

This is just another one of the deleted googolisms on Googology Wiki, deleted
because no external sources were given. It's a strange number alright.

Dutritri
{3,3(2)2} = {3,3,3(1)3,3,3(1)3,3,3}

Or
/3,3,3\
|3,3,3|
\3,3,3/ in array form. This is a square of nine threes.
Dutridecal
{10,3(2)2}

Or
/10,10,10\
|10,10,10|
\10,10,10/, This is replacing every entry in the enormous dutritri with a 10, but
really not too much of an improvement. We’ll need to go better, and faster.

Triubol
{10,100(1)(1)(1)2}

A 3x100 array of 10s, and a number I coined.

Trito-godgahlah
E100#^#*#^#*#^#100 = E100#^##3

At last we’re in the realm of #^##. Whew, that was a long way. But we’re still a
long way to #^#^# and an even longer way to #^^#.

A deutero-godgahlah is about a 2-row array, trito- is 3 rows.....you can guess what

a teterto-godgahlah would be.

Tetrubol
{10,100(1)(1)(1)(1)2}

Comparable to teterto-godgahlah.

Teterto-godgahlah
E100#^#*#^#*#^#*#^#100 = E100#^##4

Comparable to a 100-length 4-row array of 10s.

Pepto-godgahlah
E100#^##5

Exto-godgahlah
E100#^##6

Epto-godgahlah
E100#^##7

Ogdo-godgahlah
E100#^##8
Ento-godgahlah
E100#^##9

Xappol
{10,10(2)2} = 10^2 & 10
The xappol is the result of solving 10x10 array of 10's in Bowers' notation. Here
is that array written out:
/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/
YIKES! This number is a good example of a big planar array. It would require an
inconceivably large number of levels of decomposition just to get rid of the last
row, and even more unfathomably long to completely solve!
The name xappol has been honored in the name XappolBot of the bot (programmed by
Vel!) in Googology Wiki's IRC chat.
Dekato-godgahlah
E100#^##10
Isosto-godgahlah
E100#^##20

Goxxol
{10,100(2)2}

Or a 100x100 array of 10s. Saibian coined this number as a number comparable to the
next number.

Gridgahlah/hecato-godgahlah
E100#^##100

This is the first real good extension to a godgahlah. It’s much further than any
naive extension of Hyper-E could dream of going, and yet it just looks like a
slight extension. Bigger and better numbers are coming our way, be prepared. This
number is also in the same general domain of numbers as Bowers’ xappol, even though
this is significantly bigger.
Xappolplex
{10,xappol(2)2}
The planar array for this number would be too big to fit in the observable
universe, or even for x observable universes where x is the number of Planck
volumes in the universe - these numbers transcend any such analogy anyway. This
number is the next step in recursion from a xappol.

The Multidimensional-Array Range

{a,b(2)2} - {a,b(c)2}
(order type w^w^2 ~ w^w^w)
Entries: 43
Grand xappol
{10,10(2)3}

Remember the array used to define a xappol? Put a 2 behind the first 10 and you get
this. When you solve it to a planar array it would be horrendously huge, and then
you'll need to go through insane decompositions just to even turn it into a linear
array! However, with numbers this large this is a pretty modest improvement, as
it's only doubling the order type!

Gridtrigahlah
E100#^##100#^##100

Notice how we’re zooming a lot quicker than previously. This number is comparable
to grand xappol as gridgahlah is to xappol.

Gridtergahlah
E100#^##*#4

E100#^##*#100

Saibian does not define this and goes straight to bigger numbers, This number could
probably be called a gridgoldgahlah.

E100#^##*##100

Could probably be called gridthroogahlah.

E100#^##*#^#100

This might be called a gridgodgahlah, I don't know. Saibian doesn't give a name for
this number.

Deutero-gridgahlah
E100#^##*#^##100

Just as a deutero-godgahlah is 2 rows, a deutero-gridgahlah is 2 planes.

Dimentri
{3,3(3)2} = 3^3&3

Or {3,3,3(1)3,3,3(1)3,3,3(2)3,3,3(1)3,3,3(1)3,3,3(2)3,3,3(1)3,3,3(1)3,3,3} in full.
This is a 3x3x3 cube of 27 3s and it's an unspeakable sized number in its own
right. But it pales in comparison to the next numbers.
Trito-gridgahlah
E100#^##*#^##*#^##100

About a 100x100x3 cube of 10s. Now let’s skip to a Bowersism:

Colossol
{10,10(3)2}=10^3&10

This colossal number is a 10x10x10 CUBE of 10’s! It's a horrendous sized number of
order type w^w^3, and decomposing it leads to insane levels of recursion. It was
formerly called colossal.

Dekato-gridgahlah
E100#^###10

The closest Saibianism to a colossol.

Coloxxol
{10,100(3)2}=100^3&10

Instead of just a 10x10x10 cube of 10’s, this is a 100x100x100 cube of a million

10s! Saibian coined this to have a number comparable to kubikahlah.

Kubikahlah
E100#^###100

About a 100x100x100 CUBE of 10s! We’re really getting to awesome stuff with these
epicly huge numbers. This number is reasonably close to a colossol.

Deutero-kubikahlah
E100#^###*#^###100

About a 100x100x100x2 tesseract of 10s! This number is heading straight into 4

dimensional arrays. How about....

Terossol
{10,10(4)2}=10^4&10

A 10x10x10x10 tesseract of 10s! Tesseracts can be drawn by hand quite easily, but
still quite mind-boggling to imagine. They aren’t too bad compared to higer
dimensions. Anyway, solving this number would requitre solving 10 cubes, each
bigger than the previous! Each cube would requite lots and lots of squares to
solve, and lots more linear arrays just to decompose the squares! You’d end up with
a vast linear array, and it’ll take a grueling number of steps to solve that into
the final number!
Dekato-kubikahlah
E100#^####10

Comparable to terossol.

Teroxxol
{10,100(4)2}

Instead of just 10 cubes, solving this would take 100 enormous cubes! Just
imagining this boggles your mind greatly. But it pales in comparison to the
insanity of tetrational arrays (seen in a bit).

Quarticahlah
E100#^####100

We’re almost to the realm of #^#^# numbers. This mind-boggling number is about a
100^4 tesseract of 10s! Solving the Cascading-E expressions isn’t much better than
the arrays; you’ll need to correctly sort out the hyper-operators and probably mess
up a bunch of times!

Petossol
{10,10(5)2}

A 10^5 penteract of 10s. It requires solving multiple tesseracts, which in turn

requires solving a mind-boggling number of cubes, and an even more mind-boggling
number of squares, and rows, and we just can’t grasp how anyone would solve this! I
suppose he still could, but at this point the computation is becoming abstract in
itself.

Quinticahlah
E100#^#####100

Or E100#^#^#5. At last we reached the realm of #^#^#! Not too long to E100#^#^#100
anymore. You can guess what comes next...

Ectossol
{10,10(6)2}

A 10^6 hexeract of 10s! While we can draw tesseracts and penteracts quite eaily and
still make them out, hexeracts and beyond will start to look like a mess even when
mapped out by a computer program. The levels of decomposition needed to solve this
are getting more and more horrendously huge.

Sexticahlah
E100#^#^#6
Zettossol
{10,10(7)2}

Septicahlah
E100#^#^#7

Yottossol
{10,10(8)2}

Octicahlah
E100#^#^#8

Ogdo-octicahlah
E100#^#^#98

This is Sbiis Saibian's 3000th googolism, defined using Cascading-E notation. It's
approximately {10,100(8)(8)(8)(8)(8)(8)(8)(8)2} (8 (8)s) using Bowers' dimensional
array notation.
Xennossol
{10,10(9)2}

Xenna- is one of the unofficial SI prefixes used for 1000^9, or an octillion.

Bowers seems to like using this one.

Nonicahlah
E100#^#^#9

Dimendecal
{10,10(10)2} = 10^10 & 10

A 10-dimensional array of 10s! Solving this would require continuously going

through hypercubes, back and forth as the array slowly decreases in complexity.

Decichlah
E100#^#^#10

Viginticahlah
E100#^#^#20

Nonaginticahlah
E100#^#^#90

Saibian defines more -cahlah numbers, but I’m skipping most of them because I don’t
want to be repetitive. This is the last Saibianism smaller than the gongulus.
Gongulus
{10,10(100)2} = 10^100 & 10

A gongulus is an unspeakably huge number coined by Jonathan Bowers. It's a 100-

dimensional array of tens, which has exactly a googol entries when the array is
expanded out. Bowers seems to bring that number up a lot more than other numbers of
his (see negative gongulus, part 1).

At this point, just to shake you up a little let's take a moment to discuss how
INCREDIBLY HUGE a gongulus is. Tthis number makes Graham look adorable, to say the
least. Graham’s number is so small that once you are introduced to it, you can
explain it to anyone and they can understand how it would be computed! A gongulus,
however, is far far beyond weeny little numbers whose computation you can
understand. It’s much much much much much ... ... ... MUCH larger than Graham's
number. A 100-dimensional cube may not seem too overwhelming, but once we get into
it your mind will be blown.

To start off, a gongulus will look a bit like this:

x x x x x x x x x where each x is a 99-dimensional cube
And each 99-dimensional cube will consist of 10 98-dimensional cubes, and each of
those will consist of 97-dimensional cubes, and each of THOSE will consist of 96-
dimensional cubes, etc. The starting array for a gongulus will have a googol 10’s!
Still not impressed? Then let’s go inside the centeract (100-dimensional cube) and
start seeing how it would be solved! First, you’ll need to solve the last 99-
dimensional cube to turn the hypercube into an x*x*x*x.......*x*9 array of tens.
But to solve that, you’ll need to solve a bunch of 98-dimensional cubes, and for
each of those you’ll need to solve a bunch of 97-dimensional hypercubes, and for
each one a 96-cube ... ... somewhere in the middle there’s 50, 49, 48, 47, etc.
cubes ... ... until you get to the lines that decompose the squares, which in turn
decompose the cubes, then the tesseracts ... each dimemsion would be more
horrendous to solve than the previous! And that’s only the first 99-dimensional
cube! Once you’ve got that 99-cube out of the way, you’ll need to solve the next
incomprehensibly large 99-cube, but that would require solving lots and lots of 98-
cubes, which requires a huge amount of 97-cubes, and a huge amount of 96-cubes, 95-
cubes ... ... 29-cubes, 28-cubes ... ... tesseracts, cubes, squares, lines! Then
the third 99-cube will need to be solved, and the fourth 99-cube next, each bigger
than the previous, continuing with the fifth, sixth, seventh, eighth, ninth, and
then the last 99-dimensional cube! To solve that cube, you’ll need a seemingly
endless amount of 98-cubes, followed by 97, 96-, etc. cubes, but you’ve done that
before a bunch of times, just this time it’s even bigger! Once you’re down to a 98-
cube solve that to a 97-cube (which still  requires 96-, 95-, 94-cubes ... ... ...
tesseracts, cubes, squares, lines)! Once that 97-cube is over and you have a 96-
cube, you’ll need to continue and continue through 94 more dimensions until you get
an insanely big planar array, and you’ll need to solve that until you get a very,
very long linear array! You’ll ned to solve that into gradually smaller linear
arrays, and then into an up-arrow notation where you’ll need to repetitively
evaluate the expresssions until you finally get a huge power of 10! Evaluate that,
and that is a gongulus! And that isn’t even the full picture! It seems to never
come to an end when trying to solve, as Bowers says.
That long explanation above is much longer and more overwhelming than any
explanation of Graham’s number! And a full explanation of Graham’s number is wimpy
compared to this mind-boggling overview of the computation of a gongulus! The
gongulus is much much too mighty for us mortals to comprehend. Yet it’s only the
beginning of a series of much worse numbers! Eventually we won’t be able to even
imagine anything of what the arrays would be like! In other words, the gongulus, as
mighty as it is, is easily trumped by FAR more unfathomable numbers!
All in all, this number is a great example of a number that really crushes Graham's
number - Sbiis Saibian describes the huge difference in a blog post, and suggests
using a gongulus to replace the fame held by Graham's number, since Graham's
number, by googological standards, is quite tiny and easy to analyze. Though I
personally would transfer Graham's honor to something like the even bigger TREE(3),
which like Graham's number has serious use in mathematics.

Second gongulus / Gonguxxus

{10,100(0,1)2} = {10,100(100)2} = 100^100 & 10

Bowers’ gongulus extensions (such as {10,100(0,3)2} or {10,100(0,0,0,0,1)2}) don’t

really match the gongulus, since there’s no way to express a gongulus as
{a,b(x,y)c}. To fix this problem, Aarex coins the second gongulus, which matches
better with the extensions.

Sbiis Saibian calls this number gonguxxus continuing the goxxol, coloxxol,
teroxxol, etc, idea.

Godgathor
E100#^#^#100

We’re all in all done with the godgahlah, gridgahlah, kubikahlah, and -icahlah
series (collectively the godgahlah gang) and we’ve moved on to a whole new gang.
Behold the godgathor gang. This Saibianism is comparable to the gongulus but closer
to the second gongulus.

Even though #^#^# looks a lot friendlier than an x-dimensional array, guess what?
It’s just as bad. Each #^#99 (#^####....#### with 99 #s) is equivalent to a 99-
cube, each #^#98 is equal to a 98-cube, etc. Decomposing this will be quite akin to
the horrendous decomposition of a gongulus!

Goober bunch
E100#^#101100

This irregular number was defined by Saibian to break the monotony of his numbers.
It’s defined as E100#^#100*#^#100*#^#100......#^#100100 with 100 #^#100s,
simplifying to the expression above.

Gongulusplex
{10,10(gongulus)2}

Remember the 100 dimensions we went through in the long gongulus paragraph? Now
imagine having to go through a gongulus dimensions! We’ll pass through every whole
number in this list up to a gongulus when working with the number of dimensions.
Since you can’t even imagine how big a gongulus would be, it’s even more mind-
boggling to imagine solving a gongulus-dimensional cube!
As impressive as this number is, it’s still a naive extension because anyone
introduced to the gongulus could come up with that. We’ll need to move much faster
than ANY recursion to get anywhere!

Grand godgathor
E100#^#^#100#2

Or E100#^#godgathor100. It looks absolutely amazing, but it’s the same situation as

a gongulusplex.

Gibbering goober bunch

E100#^#goober bunch+1(goober bunch)

Defined as E100#^#goober bunch*#^#goober bunch#^#goober bunch......#^#goober

bunch100 with a goober bunch #^#goober bunchs. It looks ambitious, but once again
it isn’t a good improvement.

Gongulusduplex
{10,10(gongulusplex)2}

Just imagine......you’ll need to go through a gongulusplex dimensions to solve the

number. Doing that and growing through such a gigantic number of dimensions brings
a sense of vast darkness. Kinda creepy if your think about it.

Gongulustriplex
{10,10(gongulusduplex)2}

Gongulusquadriplex
{10,10(gongulustriplex)2}

Superdimensional Array Numbers 

{a,b(c)2}~{a,b((1)1)c} 
(order type w^w^w ~ w^w^w^w) 
Entries: 50

Gotrigathor 
E100#^#^#100#^#^#100 

Notice how we’re skipping stuff like E100#^#^#100##100 and heading straight to the
good stuff. 

Also, superdimensional arrays are arrays which have dimensions of dimensions. It’s
the first level of tetrational arrays. Following are trimensions (dimensions of
superdimensions) and quadramensions, which are the higher tetrational arrays. 

Deutero-godgathor 
E100#^#^#*#^#^#100 
Or E100#^(#^#*#)2. 

Trito-godgathor 
E100#^#^#*#^#^#*#^#^#100 

Or E100#^(#^#*#)3. 

Hecato-godgathor / Godgathorfact
E100#^(#^#*#)100 

Note that E100#^#^#*#^#^#*#^#^#*#^#^#......*#^#^#100 with 100 #^#^#s is NOT

E100#^#^##100. It simplifies to only E100#^(#^#*#)100 .

Godgridgathor / Godgathordeuterfect
E100#^(#^#*##)100 

Decomposes to E100#^(#^#*#)*#^(#^#*#)*#^(#^#*#)*......#^(#^#*#)100, with 100

#^(#^#*#)s. Just imagine how many multiplication strings you’ll need to go through
to decompose that. 

Dulatri 
{3,3(0,2)2} 

This Bowersism serves to help us better understand superdimensional arrays. To

picture this array, imagine a 3x3x3 cube, but with each of the 27 slots filled with
a 3x3x3 cube of 3’s, making it a number that scratches the surface of tetrational
arrays. It’s also equal to an X^2X array of 3’s, with 729 threes.

Godcubicgathor / Godgathortritofact
E100#^(#^#*###)100 

Godquarticgathor / Godgathortetrifact
E100#^(#^#*####)100 

Gingulus 
{10,100(0,2)2} 

A 100^(2*100) array of 10’s. This is the first group of superdimensions. To solve

visualize this array, imagine a 100^100 dimensional array, but each slot is filled
with a gongulus array. The array has 10^400 entries in total. 

Godgathordeus 
E100#^(#^#*#^#)100 

Comparable to the gingulus. We’re almost to E100#^#^##100! Also, we can define the
hecato-godgathordeus, and godgrid-, -cubic-, and -quarticgathordeus. 

Gangulus 
{10,100(0,3)2} 

A 100^(3*100) array of 10’s. The array can be visualized as a gongulus array of

ginguluses. 

Godgathortruce 
E100#^(#^#*#^#*#^#)100 

Simplifies to E100#^(#^##)3, or just E100#^#^##3. Comparable to gangulus. 

Geengulus 
{10,100(0,4)2} 

Godgathorquad 
E100#^#^##4 

Gowngulus 
{10,100(0,5)2} 

Godgathorquid 
E100#^#^##5 

Gungulus 
{10,100(0,6)2} 

Godgathorsid 
E100#^#^##6 

Godgathorseptuce 
E100#^#^##7 

Godgathoroctuce 
E100#^#^##8 

Godgathornonice
E100#^#^##9

Godgathordecice
E100#^#^##10

Bongulus 
{10,100(0,0,1)2} 

Or {10,100(0,100)2}. A 100^100^2 array of 10’s, but still a low level

superdimensional array. If stage 1 is the second gongulus, stage 2 is the gingulus,
stage 3 is the gangulus, stage 4 is the geengulus, etc, then this is stage 100. 

Gralgathor 
E100#^#^##100 

Here’s a really epic number, comparable to bongulus. This number simplifies to

E100#^(#^#*#^#*#^#*#^#*#^#......#^#)100 with 100 #^#s! To simplify it, you would
start off with E100#^(#^#*#^#*#^#........*#100)100, which first decomposes to
E100#^(#^#*#^#*#^#........*#99)*#^(#^#*#^#*#^#........*#99)*#^(#^#*#^#*#^#........*
#99).......*#^(#^#*#^#*#^#........*#99)100 with 100 #^(#^#*#^#*#^#........*#99)s!
The last (but ONLY the last) #^(#^#*#^#*#^#........*#99) decomposes to
#^(#^#*#^#*#^#........*#98*#^(#^#*#^#*#^#........*#98)*#^(#^#*#^#*#^#........*#98).
...*#^(#^#*#^#*#^#........*#98), then the last one of those decomposes to
#^(#^#*#^#*#^#........*#97*#^(#^#*#^#*#^#........*#97)*#^(#^#*#^#*#^#........*#97).
...*#^(#^#*#^#*#^#........*#97), then we'll have to repeat the process 97 more
times to end with a #^(#^#*#^#*#^#*#^#.....*#^#) with 99 #^#s instead of 100. Right
then, we can decompose that very last #^# to #100 ... just so we can repeat that
whole process all over again. Then we have to repeat it 100 times until it ends
with a ridiculously long product of delimiters, but then we'll need to decompose
that, and repeat again, and decompose that, repeat again ... you can scream now ...

Absolutely mind-boggling!!!! And the godgathor (and gongulus) seemed mighty just
moments ago. They are now in the dust with the wimpy little grand godgahlahgong! I
told you numbers that make the gongulus look wimpy are headed our way - but you
ain't seen nothing yet!

Graltrigathor 
E100#^#^##100#^#^##100 

Deutero-gralgathor 
E100#^#^##*#^#^##100 

Or E100#^(#^##*#)2. 

Hecato-gralgathor 
E100#^(#^##*#)100 

Hecato-x is no longer very effective. We’re going much faster now. 

Gralgridgathor
E100#^(#^##*##)100 

Decomposes to E100@100@100@100.......@100 where each @ is #^(#^##*#). 

Gralcubicgathor
E100#^(#^##*###)100 

Gralgodgathgathor
E100#^(#^##*#^#)100 

Gralgodgathordeusgathor
E100#^(#^##*#^#*#^#)100 

Bingulus 
{10,100(0,0,2)2} 

An X^(2*X^2) array of 10s. To imagine this array, you'll need a bongulus array of
bongulus arrays - keep in mind that a bongulus array is a 100x nested array of
gongulus arrays. 

Gralgathordeus 
E100#^(#^##*#^##)100 

Or E100#^#^###2. Comparable to bingulus. 

Trimentri 
{3,3(0,0,0,1)2} 

Remember megafuga-three, which was equivalent to about 7.6 trillion? Well, that
number is used to define this number, specifically as a 3^3^3 or 3^^3 array of 3’s.
Trimentri can be expressed in various other ways. Here they are: 

{3,3(0,0,3)2}
{3,3((1)1)2} 
A 3-superdimsional array of 3’s 
A 1-trimensional array of 3’s 
3^3^3&3 
3^^3&3 
3^^^2&3 
A 3 tetrated to 3 array of 3’s 
A 3 pentated to 2 array of 3’s 
Bangulus 
{10,100(0,0,3)2} 

An X^(3*X^2) array of 10s. 

Gralgathortruce 
E100#^#^###3 

Beengulus 
{10,100(0,0,4)2} 

We saw this number’s reciprocal a loooooooooong time ago in part 1. 

Gralgathorquad 
E100#^#^###4 

Trongulus 
{10,100(0,0,0,1)2} 

In the lower superdimensional arrays but still super insane. This number is about
an X^X^3 array of 10’s! 

Thraelgathor 
E100#^#^###100 

The numbers just keep getting crazier. To compute this, you’ll need to follow the
same general thing we did with the gralgathor, then do it again and this time even
longer, and it's difficult to bring to words. Keep in mind that we can coin plenty
of numbers based on this like an isosto-thraelgathor and a thraelgathorseptuce. 

Quadrongulus 
{10,100(0,0,0,1)2} 

A four-superdimensional array of tens.

Terinngathor 
E100#^#^####100 

Comparable to the quadrongulus. 

Pentaelgathor 
E100#^#^#####100 

Hexaelgathor 
E100#^#^#^#6 

Heptaelgathor 
E100#^#^#^#7 

Octaelgathor 
E100#^#^#^#8 

Ennaelgathor
E100#^#^#^#9

Dekaelgathor
E100#^#^#^#10
Goplexulus 
{10,100((1)1)2} 

Also imaginable as: 

{10,100(0,0,0,0.......0,1)2} with 100 zeros 

100^100^100&10 

A 100-superdimensional array of tens 

A 100 tetrated to 3 array of tens 

This number is right around the end of superdimensional arrays and the beginning of
higher tetrational arrays. It's formed with some pretty insane array nesting. 

Godtothol 
E100#^#^#^#100 

This number simplifies to E100#^#^#100100 (hectaelgathor perhaps), and once solving

it further the expression expands rapidly in length. We saw how insane the
gralgathor was, so this has to be much much more crazy. By the way, this is
comparable to goplexulus.
The Ordinal-Tetration Range
{a,b(x,y.....n)c} ~ X^^X & a
(order type w^w^w^w ~ ε0)
Entries: 22

Graltothol
E100#^#^#^##100

The gralgathor was crazy, so is there a reason for this not to be super ultra mega
crazy? I think not. To solve this, you’ll need to first go through the whole
gralgathor fun zillions of times just to get anywhere. This is about an X^X^X^2, or
2-trimensional, array of tens!!

Hyper-gralgodgathorseptucegathor
E100#^#^(#^##*#^##)7

This is Sbiis Saibian's 4000th googolism, defined using Cascading-E notation. It's
a member of the graltothol squadron in the godtothol regiment. Using Bowers'
tetrational array notation this is about {10,100((2)(1)(1)(1)(1)(1)(1)(1)1)2}, and
using the fast-growing hierarchy it's approximately fw^w^w^(w^2*w7)(100). Read
Sbiis Saibian's list of Cascading-E googolisms for why it's named like that.

Thraeltothol
E100#^#^#^###100

Terinntothol
E100#^#^#^####100

Goduplexulus
{10,10((100)1)2} = 100^^4 & 10
We’re heading further and further into the tetrational arrays - this is a 100-
trimensional array of tens.

Godtertol
E100#^#^#^#^#100

We’re almost done with the Cascading-E numbers and are getting ready to head into
Extended Cascading-E. This is comparable to goduplexulus. I could include all the
numbers in the godtertathol gang and the rest of the -tathol gangs, but I don’t
want to be repetitive.

Gotriplexulus
100^^5 & 10 = {10,100(((1)1)1)2}

A 100-quadramensional array of tens.

Godtopol
E100#^#^#^#^#^#100

With these insane numbers, it may be tricky to remember that we're blasting through
them at light speed, a lot faster than we could - actually we're going WAY FASTER
than light speed through these monsters!

Godhathor
E100#^#^#^#^#^#^#100

Godheptol
E100#^#^#^#^#^#^#^#100

Godoctol
E100#^#^#^#^#^#^#^#^#100

Godentol
E100#^#^#^#^#^#^#^#^#^#100

Godekatothol
E100#^#^#^#^#^#^#^#^#^#^#100

Quintuple-hyper-terinntopoldeus
E100#^#^#^#^#^#^(#^#^#^#^####*#^#^#^#^####)100

This is Sbiis Saibian's 5000th googolism, a decent tetrational-array level number.

It is a member of the godektathol regiment and it's approximately
fw^w^w^w^w^w^(w^(w^w^w^4*2))(100) using the fast-growing hierarchy.
Tethrathoth
E100#^#^#^#^#^#^# ... ... ... ^#^#100 with 100 #s = E100#^^#100

The tethrathoth is one of Sbiis Saibian's milestone googolisms. It's comparable to

and a little smaller than Bowers’ goppatoth. It’s approximately equal to an X^^99
array of 10s. Its name comes from tetration + Thoth, the Egyptian god of
mathematics, since it's formed by tetrating #s, and it's on the order of epsilon-
zero in the fast-growing hierarchy.

Goppatoth
10^^100 & 10
A goppatoth is a large tetrational array googolism by Jonathan Bowers. It's a ten-
tetrated-to-100 array of tens, which would be 10 99-mensional array of 10s, and a 1
100-mensional array of 10s. There are a giggol 10s in the starting array, and the
number is a little bigger than a tethrathoth.
Second Goppatoth
X^^X & 100 = 100^^100 & 100

Just as the gongulus does not match with its extensions, the goppatoth will not
match with my extensions. To make it match, I’ve defined the second goppatoth to
match with those extensions, just as Aarex defined the second gongulus. That’s the
only reason this number exists.

Giaquaxul
200![200,200,200,200]
This number is pronounced gia-quazzle, and it shows how 4-entry hyperfactorial
arrays grow surprisingly quickly. In general, [a,b,c,2] hyperfactorial arrays are
on the realm of dimensional arrays, [a,b,c,3] arrays are superdimensional,
[a,b,c,4] are trimensional, [a,b,c,5] are quadramensional, etc. The next major
Hollomism (hugexul) is much much much larger and is a very long way from here.

fε0(1000)

This is just a placeholder entry to discuss order-type epsilon-zero in the fast-

growing hierarchy. It's an interesting tipping point for googologically large
numbers.

Why is that? Because after numbers of order type epsilon-zero, they quickly become
harder and harder to work with - even epsilon-one has two notably different
fundamental sequences, making comparing numbers with the fast-growing hierarchy a
lot harder to work with. There seems to be a general natural way to get up to
epsilon-zero in the FGH, but soon afterwards there are several different paths you
can take, many of which will need ways to work around the annoying +1's that may
crop up (e.g. w^(ε0+1)). After order-type epsilon-zero, BEAF also becomes harder to
work with - because of ambiguity, it is up to the reader to interpret the numbers.
Up to a certain point the numbers nowadays are pretty clear, but later levels
(discussed in parts 6-7) are still pretty unclear.

Epsilon-zero is the growth rate achieved by Cascading-E notation and Bowers'

tetrational arrays, as well as m(n) mapping used in Fish number 5 - it's a common
growth rate for functions.

I should point out that this is one of the largest levels of number size mentioned
on Wikipedia: in its article on the slow-growing hierarchy (a relative of the fast-
growing hierarchy) it says:
"The slow-growing hierarchy grows much more slowly than the fast-growing hierarchy.
Even gε0 is only equivalent to f3 and gα only attains the growth of fε0 (the first
function that Peano arithmetic cannot prove total in the hierarchy) when α is
the Bachmann–Howard ordinal."
However, Wikipedia discusses still larger numbers later, and the largest computable
number to appear on Wikipedia may be the famous TREE(3).
Tethrathothigong
E100,000#^#^#^#^#.......^#100,000 with 100,000 #s = E100,000#^^#100,000

This is the gong version of a tethrathoth, for old time's sake as Sbiis Saibian
said. It's technically insanely larger than a tethrathoth with 100,000 cascade
levels instead of just 100, but it's a modest improvement compared to what's next.

Grand tethrathoth
E100#^#^#^#^#^#^#...........^#100 with tethrathoth #s = E100#^^#100#2

The next step in recursion for a tethrathoth. This might seem utterly insane, but
it's still a naive extension because anyone who encountered the tethrathoth can
come up with such a number. We need to go MUCH faster to really get anywhere.
Goppatothplex
10^^goppatoth & 10

A goppatoth is a ten tetrated to a goppatoth array of tens, the next step in

recursion after a goppatoth.
NOTE: If you are a seasoned googologist reading this list, you may object to me
including Bowersisms past a goppatothplex beyond this list. I know that Bowers'
notation past tetrational arrays is not fully defined (and that there isn't even
full consensus), and I don't object to that statement. However, I still feel a need
to include the numbers.

Therefore I am going to put them in based on the value using Bowers' and Saibian's
theory of the climbing method (see Bowers' hypernomials page and Saibian's Extended
Cascading-E page) for numbers up to {X,X(1)2} arrays. After that point I will rely
on the approximate value (in terms of the fast-growing hierarchy) that seems most
accepted in the googology community, based mainly on Hyp cos's BEAF "analysis" (for
more on that see entries in part 6 right before TREE(3)).
Grand grand tethrathoth
E100#^^#grand tethrathoth = E100#^^#100#3

The Epsilon Range

X^^X&a - X^^(X+1)&a
(order type ε0 ~ εw)
Entries: 61

Fish number 5
~fε0+1(63)

This number was defined by Kyodaisuu of Googology Wiki in 2003. It uses a system
called m(n) mapping that reaches epsilon-zero in the fast-growing hierarchy, the
same power of Bowers' tetrational arrays. The number falls just under a
grantethrathoth, which is about fε0+1(100).

Grangol-carta-tethrathoth / grantethrathoth / 99-ex-grand tethrathoth

E100#^^#100#100
This number is also equal to 99-ex-grand tethrathoth.

Greagol-carta-tethrathoth/greatethrathoth
E100#^^#100#100#100

Gigangol-carta-tethrathoth/gigantethrathoth
E100#^^#100#100#100#100

Gugolda-carta-tethrathoth
E100#^^#100##100

Gugolthra-carta-tethrathoth
E100#^^#100##100##100

Output of marxen.c
~ fε0+w2(1,000,000)

This is Heiner Marxen's entry in Bignum Bakeoff, the second place entry in Bignum
Bakeoff. Unlike other submissions, this one uses a fast-growing function called
Goodstein sequences that reaches epsilon-zero in the fast-growing hierarchy, then
iterates it to produce a number that makes it a little further than order type
epsilon-zero. It can be approximated in Extended Cascading-E as
E1,000,000#^^#1,000,000##1,000,000##1,000,000, placing it just above a gugolthra-
carta-tethrathoth. It's difficult to use only 512 characters to create a recursive
function in C like the other people did that reaches epsilon-zero, which is why
using a fast-growing function like Goodstein sequences is clever.

The output of marxen.c is far far smaller than the winning entry. The winning entry
is the output of loader.c, Ralph Loader's entry, which is often called Loader's
number. We don't even know how to approximate Loader's number in the fast-growing
hierarchy because it's so huge. Loader's number can be found in part 7 of this list
(COMING SOON).

Throogola-carta-tethrathoth
E100#^^#100###100

Teroogola-carta-tethrathoth
E100#^^#100####100
Godgahlah-carta-tethrathoth
E100#^^#100#^#100

Gridgahlah-carta-tethrathoth
E100#^^#100#^##100

Kubikahlah-carta-tethrathoth
E100#^^#100#^###100

Quarticahlah-carta-tethrathoth
E100#^^#100#^####100

Godgathor-carta-tethrathoth
E100#^^#100#^#^#100

Godtothol-carta-tethrathoth
E100#^^#100#^#^#^#100

Tethrathoth-carta-tethrathoth/tethratrithoth
E100#^^#100#^^#100 = E100#^^#*#3
Tethraterthoth
E100#^^#100#^^#100#^^#100 = E100#^^#*#4

Tethrathoth-by-hyperion
E100#^^#*#100

Tethrathoth-by-deutrohyperion
E100#^^#*##100

Evaluates to E100#^^#*#100#^^#*#100.....#^^#*#100 with 100 100’s.

Tethrathoth-by-tritohyperion
E100#^^#*###100

Tethrathoth-by-godgahlah
E100#^^#*#^#100

Tethrathoth-by-godgathor
E100#^^#*#^#^#100

Deutero-tethrathoth
E100#^^#*#^^#100 = E100(#^^#)^#2

Trito-tethrathoth
E100#^^#*#^^#*#^^#100 = E100(#^^#)^#3

Hecato-tethrathoth/tethrafact
E100(#^^#)^#100

This number is called tethrafact because the tethrathoth delimiter is the only
factor of the whole expression. It’s still not really that great of an improvement,
but kind of the base for what will come.

Grideutertethrathoth
E100(#^^#)^##100

Or E100(#^^#)^#*(#^^#)^#*(#^^#)^#.....*(#^^#)^# with 100 (#^^#)^#s. This number can

also be called hecato-tethrafact, but Saibian does not give this name.

Kubicutethrathoth
E100(#^^#)^###100 = E100(#^^#)^#^#3

Tethragodgathor / Centicutethrathoth
E100(#^^#)^#^#100

Tethragodtothol
E100(#^^#)^#^#^#100 = E100(#^^#)^(#^^#)3

Tethraduliath/tethra-tethrathoth/tethrathoth-dopplux/tethrathoth-dubletetrate
E100(#^^#)^(#^^#)100 = E100(#^^#)^^#2

This is a milestone point in Extended Cascading-E - it's just starting on tetrating

the tethrathoth delimiter. Pretty soon the tetration will be iterated. It's
interesting to point out that Saibian explicity gives four different names for this
number.

Tethradulifact
E100(#^^#)^(#^^#*#)100
Evaluates to E100(#^^#)^(#^^#)*(#^^#)^(#^^#)*(#^^#)^(#^^#).....*(#^^#)^(#^^#) with
100 (#^^#)^(#^^#)s.

Grideutertethraduliath
E100(#^^#)^(#^^#*##)100

Tethraduli-godgathor
E100(#^^#)^(#^^#*#^#)100

Tethrathruliath
E100(#^^#)^(#^^#*#^^#)100

Tethraterliath
E100(#^^#)^(#^^#*#^^#*#^^#)100 = E100(#^^#)^(#^^#)^#3

Monster-Giant
E100(#^^#)^(#^^#)^#100

The somewhat irregular Monster-Giant is a pretty awesome number. It decomposes to

E100(#^^#)^(#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*
#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*
#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*
#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*
#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*
#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*
#^^#*#^^#*#^^#*#^^#*#^^#*#^^#)100.

This is pretty insane now (comparable to a (X^^X)X array), but only starting a
whole new realm of insanity.

Grand Monster-Giant
E100(#^^#)^(#^^#)^#100#2

Or E100(#^^#)^(#^^#*#^^#*#^^#*#^^#*#^^#*......................*#^^#)100 with
Monster-Giant+1 #^^#s! As impressive as this sounds, it's still a naive extensions.
We can further extend upon the Monster-Giant with numbers like:

Deutero-Monster-Giant
E100(#^^#)^(#^^#)^#*(#^^#)^(#^^#)^#100

Trito-Monster-Giant
E100(#^^#)^((#^^#)^#*#)3

Hecato-Monster-Giant
E100(#^^#)^((#^^#)^#*#)100

Tethra-Monster-Giant
E100(#^^#)^((#^^#)^#*#^^#)100

Tethraduli-Monster-Giant
E100(#^^#)^((#^^#)^#*#^^#*#^^#)100 = E100(#^^#)^((#^^#)^#*(#^^#)^#)2

Monster-Monster-Giant = Two-ex-Monster-Giant
E100(#^^#)^((#^^#)^#*(#^^#)^#)100 = E100(#^^#)^(#^^#)^##2

Three-ex-Monster-Giant
E100(#^^#)^((#^^#)^#*(#^^#)^#*(#^^#)^#)100 = E100(#^^#)^(#^^#)^##3

Hundred-ex-Monster-Giant/Monster-Grid
E100(#^^#)^(#^^#)^##100

Monster-Giant-ex-Monster-Giant
E100(#^^#)^(#^^#)^##(Monster-Giant)

Grand Monster-Grid
E100(#^^#)^(#^^#)^##100#2

Monster-Cube
E100(#^^#)^(#^^#)^###100

Monster-Tesseract
E100(#^^#)^(#^^#)^####100

Monster-Hecateract
E100(#^^#)^(#^^#)^#^#100

Tethrathoth-trebletetrate
E100(#^^#)^(#^^#)^(#^^#)100 = E100(#^^#)^^#3

Super Monster-Giant
E100(#^^#)^(#^^#)^(#^^#)^#100

Evaluates to:

E100(#^^#)^(#^^#)^(#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*
#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*
#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*
#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*
#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*
#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*
#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#*#^^#)100

Super Monster-Grid
E100(#^^#)^(#^^#)^(#^^#)^##100

Tethrathoth-quadrupletetrate
E100(#^^#)^^#4

Tethrathoth-quintupletetrate
E100(#^^#)^^#5

Tethrathoth-decupletetrate
E100(#^^#)^^#10

Terrible tethrathoth
E100(#^^#)^^#100

Evaluates to E100(#^^#)^(#^^#)^(#^^#)^(#^^#)^(#^^#).......^(#^^#) with 100 (#^^#)s.

Dubletetrated terrible tethrathoth

E100((#^^#)^^#)^((#^^#)^^#)100 = E100(((#^^#)^^#)^^#)2
Trebletetrated terrible tethrathoth
E100(((#^^#)^^#)^^#)3

Double-terrible tethrathoth
E100(((#^^#)^^#)^^#)100

Triple-terrible tethrathoth
E100((((#^^#)^^#)^^#)^^#)100

The Hyper-Epsilon Range

X^^(X+1) & a - X^^X^2 & a
(order type εw ~ ζ0)
Entries: 68

Tethriterator / Tethrathoth ba’al / 99-ex-terrible tethrathoth

E100(....((#^^#)^^#)........^^#)100 with 100 #^^#s = E100#^^#>#100

This is Sbiis Saibian's smallest googolism to use the > operator, a special
operator called the "caret top" which iterates the function applied to the # before
it. Terrible tethrathoth is E100#^^#>#2, double-terrible tethrathoth is
E100#^^#>#3, triple-terrible tethrathoth is E100#^^#>#4, and so on with the >
operator.

This number called tethriterator because it iterates the smallest tetrational

delimiter, or #^^#.

Grand tethriterator / Great and Terrible Tethrathoth / tethrathoth-ba'al-minus-one-

ex-terrible tethrathoth
E100(... ...((#^^#)^^#)^^#)^^#) ... ... ^^#)100 with tethrathoth ba’al #^^#s =
E100#^^#>#100#2

As insane as this looks, you should know by now that such recursion, unfortunately,
is not really progress anymore.

Quadrule-tetrated-tethrathoth-ex-terrible tethrathoth
E100#^^#>#(1+E100(#^^#)^(#^^#)^(#^^#)^(#^^#)100)

This is Sbiis Saibian's 6000th googolism, defined using Extended Cascading-E. It's
about fεw(fε0^ε0^ε0^ε0(100)) using the fast-growing hierarchy, or about X^^(X+1) &
((X^^X)^^4 & 100) using the climbing method interpretation of the array-of operator
in BEAF. It's an example of a number you can form by repeatedly applying the
terrible operator, but it's much smaller than even...

Grangol-carta-tethriterator
E100#^^#>#100#100

Or 99-ex-grand tethriterator. Although this is mind-crushingly larger than

something like Great-and-Terrible-Tethrathoth-ex-terrible tethrathoth, it's not
really progress. Let's jump to:

Tethritertri
E100#^^#>#100#^^#>#100 = E100#^^#>#*#3

Tethriterhecate/tethritera-by-hyperion
E100#^^#>#*#100

Tethritera-by-deutero-hyperion
E100#^^#>#*##100

Tethritera-by-godgahlah
E100#^^#>#*#^#100

Tethritera-by-tethrathoth
E100#^^#>#*#^^#100

Deutero-tethriterator
E100#^^#>#*#^^#>#100

Trito-tethriterator
E100#^^#>#*#^^#>#*#^^#>#100 = E100(#^^#>#)^#3

Hecato-tethriterator/tethriterfact
E100(#^^#>#)^#100

Grideutertethriterator/hecato-tethriterfact
E100(#^^#>#)^##100

Tethriter-godgathor
E100(#^^#>#)^#^#100

Tethriter-tethrathoth
E100(#^^#>#)^#^^#100

Tethriter-terri-tethrathoth
E100(#^^#>#)^(#^^#)^^#100

Tethriter-dubletetrate
E100(#^^#>#)^(#^^#>#)100 = E100(#^^#>#)^^#2

Terrible tethriterator
E100(#^^#>#)^^#100

Double-terrible tethriterator
E100((#^^#>#)^^#)^^#100

Tethriditerator / 100-ex-terrible tethriterator

E100#^^#>(#+#)100

Terrible tethriditerator
E100(#^^#>(#+#))^^#100

Tethritriterator / 100-ex-terrible tethritriterator

E100#^^#>(#+#+#)100 = E100#^^#>##3

Tethriquaditerator
E100#^^#>##4

Tethrigriditerator
E100#^^#>##100

Tethricubiculator
E100#^^#>###100

Tethriquarticulator
E100#^^#>####100

Tethrispatialator
E100#^^#>#^#100

Tethrispatial-squarediterator
E100#^^#>(#^#*#^#)100

Tethrispatial-cubiculator
E100#^^#>#^##3

Tethrideuterspatialator
E100#^^#>#^##100

Tethritritospatialator
E100#^^#>#^###100

Tethritetertospatialator
E100#^^#>#^#^#4

Tethri-superspatialator
E100#^^#>#^#^#100

Tethri-quadratetratediterator
E100#^^#>#^#^#^#100

Dustaculated-tethrathoth
E100#^^#>#^^#100

Can also be written as E100#^^##2.

Gippatoth
X^^2X & 100

This is a googolism I coined as a fairly low-level pentational array number. I'm

putting this and related numbers under the climbing method interpretation -
although the non-climbing interpretation is more commonly used among the googology
community, the climbing method intentionally matches nicely with Extended
Cascading-E, and is largely advocated by Bowers. This is comparable to a
dustaculated-tethrathoth.

Tethriter-turreted-tethrathoth
E100#^^#>#^^#>#100

Territethriter-turreted-tethrathoth
E100#^^#>(#^^#>#)^^#100

Not to be confused with the much smaller terrible tethriter-turreted-tethrathoth.

Tethriditer-turreted-tethrathoth
E100#^^#>#^^#>(#+#)100
Tethritriter-turreted-tethrathoth
E100#^^#>#^^#>##3

Tethrigriditer-turreted-tethrathoth
E100#^^#>#^^#>##100

Tristaculated-tethrathoth
E100#^^#>#^^#>#^^#100

Gappatoth
X^^3X & 100

Comparable to a tristaculated-tethrathoth.

Tetrastaculated-tethrathoth
E100#^^#>#^^#>#^^#>#^^#100

Geepatoth
X^^4X & 100

Pentastaculated-tethrathoth
E100#^^##5

Dekastaculated-tethrathoth
E100#^^##10

Tethracross / Tethrasquare
E100#^^##100

A tethracross is another one of Sbiis Saibian's milestone googolisms. It's on the

order of zeta-zero in the fast-growing hierarchy. It evaluates to:

E100#^^#>#^^#>#^^# ... ... ... >#^^#>#^^#100 with 100 copies of #^^#

It is comparable to Bowers' kungulus using the more common interpretation of

pentational arrays, although using the climbing method (which I'm using on this
list) it's much smaller than a kungulus.

Boppatoth
X^^X^2 & 100

Another extrapolation from the tethrathoth, based on Bowers' number, the bongulus.
It's comparable to a tethrasquare.

Giaquixul
200![200,200,200,200,200]

A number I coined, which is in the realm of X^^X^2 arrays. The next HAN number
after this will be the hugexul.

Berlin Wall
E100#^^##100,000,000
An irregular number defined by Saibian. The expression it expands to, or
E100#^^#>#^^#>#^^#>#^^#.....#^^#>#^^#>#^^#100 with 100,000,000 #^^#>s wouldn’t be
much longer than the real Berlin Wall, but that also depends on the text size.

Grand tethracross
E100#^^##100#2
Grand Berlin Wall
E100#^^##100,000,000#2

Fish number 6
~ fζ0+1(63)

Fish number 6 is the largest computable Fish number, defined by Kyodaisuu of

Googology Wiki in 2007. It extends upon Fish number 5's system with a two-argument
function that reaches zeta-0 in the fast growing hierarchy (the power of X^^X^2
arrays), so it falls just under a grangol-carta-tethrasquare, equal to about
fζ0+1(100)

The Zeta-Eta Range

X^^^X^2 & a - X^^X^X & a
(order type ζ0 ~ φ(w,0))
Entries: 121
Grangol-carta-tethrasquare
E100#^^##100#100

Godgahlah-carta-tethrasquare
E100#^^##100#^#100

Tethrathoth-carta-tethrasquare
E100#^^##100#^^#100

Tethriterator-carta-tethrasquare
E100#^^##100#^^#>#100

Tethrasquare-by-deuteron
E100#^^##100#^^##100

Tethrasquare-by-triton
E100#^^##100#^^##100#^^##100 = E100#^^##*#4

Tethrasquare-by-hyperion
E100#^^##*#100

Tethrasquare-by-deuterohyperion
E100#^^##*##100

Tethrasquare-by-godgahlah
E100#^^##*#^#100

Tethrasquare-by-tethrathoth
E100#^^##*#^^#100

Tethrasquare-by-tethriterator
E100#^^##*#^^#>#100
Deutero-tethrasquare
E100#^^##*#^^##100

Trito-tehtrasquare
E100#^^##*#^^##*#^^##100 = E100(#^^##)^#3

Hecato-tethrasquare/tethrasquarorfact
E100(#^^##)^#100

Grideutertethrasquare
E100(#^^##)^##100

Centicutethrasquare
E100(#^^##)^#^#100

E100(#^^##)^#^#^#100

E100(#^^##)^(#^^#)100

E100(#^^##)^(#^^#>#)100

Dutetrated-tethrasquare
E100(#^^##)^(#^^##)100

Tritetrated-tethrasquare
E100(#^^##)^(#^^##)^(#^^##)100 = E100(#^^##)^^#3

Terrible tethrasquare
E100(#^^##)^^#100

Tethriterated-tethrasquare
E100(#^^##)^^#>#100

Tethrastaculated-tethritertethrasquare
E100(#^^##)^^#>#^^#100

Tethriterstaculated-tethritertethrasquare
E100(#^^##)^^#>#^^#>#100

Dustaculated-tethraturreted-tethritertethrasquare
E100(#^^##)^^#>#^^#>#^^#100

Tristaculated-tethraturreted-tethritertethrasquare
E100(#^^##)^^#>#^^#>#^^#>#^^#100 = E100(#^^##)^^#>#^^##3

Tetrastaculated-tethraturreted-tethritertethrasquare
E100(#^^##)^^#>#^^##4

Tethrasquare-turreted-tethritertethrasquare
E100(#^^##)^^#>#^^##100

Territethrasquare-turreted-tethritetrtethrasquare / Dustaculated-
tethritertethrasquare
E100(#^^##)^^#>(#^^##)^^#100

Sorry that the names sound absurdly long, but it kind of needs to be that way if we
want to have a useful system to name any such number. After all, naming systems are
a big part of googology, and almost by necessity the names can get pretty long.
Tristaculated-tethritertethrasquare
E100(#^^##)^^#>(#^^##)^^#>(#^^##)^^#100 = E100(#^^##)^^##3

Tetrastaculated-tethritertethrasquare
E100(#^^##)^^##4

Dekastaculated-tethritertethrasquare
E100(#^^##)^^##10

Secundo-tethrated tethrasquare
E100(#^^##)^^##100

Dustaculated-secundo-tethrated tethrasquare
E100(#^^##)^^##>(#^^##)^^##100

Tristaculated-secundo-tethrated tethrasquare
E100(#^^##)^^##>(#^^##)^^##>(#^^##)^^##100 = E100((#^^##)^^##)^^##3

Thrice-tethrasecunda
E100((#^^##)^^##)^^##100 = E100#^^##>#3

Quatrice-tethrasecunda
E100#^^##>#4

Tethrasquarediterator
E100#^^##>#100

Tethrasquared-diterator
E100#^^##>(#+#)100 = E100#^^##>##2

Tethrasquared-triterator
E100#^^##>##3

Tethrasquared-griditerator
E100#^^##>##100

Tethrasquared-cubiculator
E100#^^##>###100

Tethrasquared-spatialator
E100#^^##>#^#100

Tethrasquared-superspatialator
E100#^^##>#^#^#100

Tethrasquared-quadratetratediterator
E100#^^##>#^^#4

Tethraturreted-tethrasquare
E100#^^##>#^^#100

Dustacu-tethraturreted-tethrasquare
E100#^^##>#^^#>#^^#100

Tristacu-tethraturreted-tethrasquare
E100#^^##>#^^#>#^^#>#^^#100 = E100#^^##>#^^##3

Dustaculated-tethrasquare
E100#^^##>#^^##100

Tristaculated-tethrasquare
E100#^^##>#^^##>#^^##100 = E100#^^###3

Tetrastaculated-tethrasquare
E100#^^###4

Dekastaculated-tethrasquare
E100#^^###10

Tethracubor / tethratertia
E100#^^###100

A tethracubor is of the order of eta-zero in the fast-growing hierarchy. It's the

next of Sbiis Saibian's milestone googolisms, and its name begins the idea of
naming numbers after multidimensional figures.

Troppatoth
X^^X^3 & 100

Comparable to tethracubor.

Grand tethracubor
E100#^^###100#2 = E100#^^###tethracubor

Deutero-tethracubor
E100#^^###*#^^###100

Hecato-tethracubor/tethracuborfact
E100(#^^###)^#100

Grideutertethracubor
E100(#^^###)^##100

Tethracubor-godgathored
E100(#^^###)^#^#100

Tethracubor-godtotholed
E100(#^^###)^#^#^#100

Tethracubor-isptethrathoth
E100(#^^###)^#^^#100

Tethracubor-isptethriterator
E100(#^^###)^#^^#>#100

Tethracubor-isptethrasquaror
E100(#^^###)^#^^##100

Dutetrated-tethracubor
E100(#^^###)^(#^^###)100

Tritetrated-tethracubor
E100(#^^###)^(#^^###)^(#^^###)100 = E100(#^^###)^^#3
Terrible tethracubor
E100(#^^###)^^#100

Terrible terrible tethracubor

E100((#^^###)^^#)^^#100 = E100(#^^##)^^#>#2

Tethritertethracubor
E100(#^^###)^^#>#100

Dustaculated-territethracubor
E100(#^^###)^^#>(#^^###)^^#100

Tristaculated-tethracubor
E100(#^^###)^^#>(#^^###)^^#>(#^^###)^^#100 = E100(#^^###)^^##3

Terrisquared-tethracubor
E100(#^^###)^^##100

Territerated terrisquared-tethracubor
E100((#^^###)^^##>#100

Double-terrisquared-tethracubor
E100((#^^###)^^##)^^##100

Triple-terrisquared-tethracubor
E100(((#^^###)^^##)^^##)^^##100 = E100(#^^###)^^##>#3

Terrisquarediter-tethracubor
E100(#^^###)^^##>#100

Dustaculated-terrisquared-tethracubor
E100(#^^###)^^##>(#^^###)^^##100

Tristaculated-terrisquared-tethracubor
E100(#^^###)^^##>(#^^###)^^##>(#^^###)^^## = E100(#^^###)^^###3

Tethraducubor
E100(#^^###)^^###100

Tethratricubor
E100((#^^###)^^###)^^###100

Tethratetracubor
E100(((#^^###)^^###)^^###)^^###100 = E100#^^###>#4

Tethracubiter
E100#^^###>#100

Tethracubor-diterator
E100#^^###>(#+#)100 = E100#^^###>##2

Tethracubo-gridulator
E100#^^###>##100
Dustaculated-tethracubor
E100#^^###>#^^###100

Tristaculated-tethracubor
E100#^^####3
Tethrateron
E100#^^####100

Now we reach a bit of trouble in naming the numbers. What should we call this? An
obvious choice seems to be tethratesseract, but that’s too long. 4-dimensional
figures are often called polychorons, so another choice would be tethrapolychoron,
but that’s also too long. The name "polychoron" litterally means "many rooms" and
polychorons are composed of multiple 3-dimensional figures, so a "choron" can be
considered to be a 3-D figure. Then we can take the word “polyteron”, which is a 5-
dimensional figure. We can extract the root “teron” from there and use the
convenient name “tethrateron”. This is also convenient because the name “teron”
directly implies four.

Quadroppatoth
X^^X^4 & 100

Comparable to tethrateron.

Tethrateron-by-deuteron
E100#^^####100#^^######100

Tethrateron-by-dekatonon
E100#^^####*#11

This is Sbiis Saibian's 7000th googolism, defined using Extended Cascading-E. It's
approximately fφ(4,0)*11(100) using the fast-growing hierarchy, and X^^X^4*11 & 100
using the climbing interpretation of BEAF.

Deutero-tethrateron
E100#^^####*#^^####100

Tethrateronifact
E100(#^^####)^#100

Dutetrated-tethrateron
E100(#^^####)^(#^^####)100

Terrible tethrateron
E100(#^^####)^^#100

Territerated-tethrateron
E100(#^^####)^^#>#100

Dustaculated-territethrateron
E100(#^^####)^^#>(#^^####)^^#100 = E100(#^^####)^^##2

Terrisquared-territethrateron
E100(#^^####)^^##100

Terricubed-tethrateron
E100(#^^####)^^###100

Tethraduteron / territesserated-tethrateron
E100(#^^####)^^####100
Tethratriteron
E100((#^^####)^^####)^^####100

Tethriterteron
E100#^^####>#100

Dustaculated-tethrateron
E100#^^####>#^^####100

Tristaculated-tethrateron
E100#^^#####3

Tethrapeton
E100#^^#^#5 = E100#^^#5100

Similar in name to tethrateron, this is comparable to an X{6}100 array of tens.

We’ll breeze through this number’s group.

Deutero-tethrapeton
E100#^^#5*#^^#5100

Tethrapetonifact
E100(#^^#5)^#100

Terrible tethrapeton
E100(#^^#5)^^#100

Terrisquared tethrapeton
E100(#^^#5)^^##100

Tethradupeton
E100(#^^#5)^^#5100

Tethriterpeton
E100#^^#5>#100

Dustaculated-tethrapeton
E100#^^#5>#^^#5100

Tethrahexon
E100#^^#^#6

Tethrahepton
E100#^^#^#7

Tethra-ogdon
E100#^^#^#8

Tethrennon
E100#^^#^#9

Tethradekon
E100#^^#^#10

Tethratope / tethrahecton
E100#^^#^#100

This is the beginning of the last regiment among Sbiis Saibian's hyperion-tetration
numbers. Since a figure of any dimensions is called a polytope, we can just call
this the tethratope. This is also known as a tethrahecton from Greek "hecto-"
meaning 100. It's comparable to a X^^X^X array.

Grand tethratope
E100#^^#^#100#2

The Binary-Phi Range

X^^X^X ~ X^^^X arrays
(order type φ(w,0) ~ Γ0)
Entries: 72

Grangol-carta-tethratope
E100#^^#^#100#100
Gugolda-carta-tethratope
E100#^^#^#100##100

Godgahlah-carta-tethratope
E100#^^#^#100#^#100

Tethrathoth-carta-tethratope
E100#^^#^#100#^^#100

Tethratope-by-deuteron
E100#^^#^#100#^^#^#100

Tethratope-by-triton
E100#^^#^#100#^^#^#100#^^#^#100

Tethratope-by-teterton
E100#^^#^#*#5

Tethratope-by-hyperion
E100#^^#^#*#100

Tethratope-by-deuterohyperion
E100#^^#^#*##100

Tethtratope-by-godgahlah
E100#^^#^#*#^#100

Tethratope-by-godgathor
E100#^^#^#*#^#^#100

Tethratope-by-tethrathoth
E100#^^#^#*#^^#100

Tethratope-by-tethriterator
E100#^^#^#*#^^#>#100

Tethratope-by-tethrasquaror
E100#^^#^#*#^^##100

Tethratope-by-tethracubor
E100#^^#^#*#^^###100

Tethratope-by-tethrateron
E100#^^#^#*#^^####100

Deutero-tethratope
E100#^^#^#*#^^#^#100

Trito-tethratope
E100#^^#^#*#^^#^#*#^^#^#100

Tethratopofact
E100(#^^#^#)^#100

Terrible tethratope
E100(#^^#^#)^^#100

Terrisquared tethratope
E100(#^^#^#)^^##100

Tethradeutertope
E100(#^^#^#)^^#^#100

Tethratritotope
E100((#^^#^#)^^#^#)^^#^#100 = E100#^^(#^#)>#3

Tethritertope
E100#^^(#^#)>#100

Tethriditertope
E100#^^(#^#)>(#+#)100

Tethritritertope
E100#^^(#^#)>##3

Tethrigriditertope
E100#^^(#^#)>##100
Tethricubiculitertope
E100#^^(#^#)>###100

Tethraspatialitertope
E100#^^(#^#)>#^#100

Tethrathoth-turreted tethratope
E100#^^(#^#)>#^^#100

Dustaculated-tethratope
E100#^^(#^#)>#^^(#^#)100

Tristaculated-tethratope
E100#^^(#^#)>#^^(#^#)>#^^(#^#)100 = E100#^^(#^#*#)3

Tethratopothoth
E100#^^(#^#*#)100

Tethratoposquaror
E100#^^(#^#*##)100

Tethratopocubor
E100#^^(#^#*###)100

Tethratopodeus
E100#^^(#^#*#^#)100

Tethratopotruce
E100#^^(#^#*#^#*#^#)100 = E100#^^#^##3

Tethratopoquad
E100#^^#^##4

Tethralattitope
E100#^^#^##100

Tethralattitopodeus
E100#^^(#^##*#^##)100

Triakulus
3^^^3 & 3

This is the next official Bowersism after the goppatoth. This mind-crushingly large
number is an X^^^3 pentational array with tritri threes, and is the first
pentational array Bowers defines. It can also be written as 3&3&3. This is the
first three-based number we’ve had in quite a long time. This googologism is
approximately E3#^^#^###3, placing it between tethralattitopodeus and
tethralattitopotruce.

This number is also notable as the first non-degenerate legion array. The first
part of legion arrays is {a,b/2} = a&a&a&a....&a with b a's - {n,2/2} arrays
degenerate into linear arrays, and {1,3/2} and {2,3/2} both degenerate into 1 and
4, respectively. Therefore, triakulus is the first non-degenerate legion array.
Legion arrays are further explored in part 7.
Tethracubitope
E100#^^#^###100

Tethraquarticutope
E100#^^#^####100

Tethrato-godgathor
E100#^^#^#^#100

Tethrato-gralgathor
E100#^^#^#^##100

Tethrato-godtothol
E100#^^#^#^#^#100

Tethrato-tethrathoth / tethrarxitri
E100#^^#^^#100

This is also expressible as E100#^^^#3.

Blooshker bundle
E100#^^(#^^(100))^^#[100]100

This is one of Sbiis Saibian's irregular googolisms. Since #^^(100) decomposes to

#^#^#^#^#^#^#....^# with 100 #s, so this is E100#^^(#^#^#^#........^#)^^#100 with
102 #s. Despite looks, this number isn’t much of an improvement over tethrarxitri.
In fact, it’s less than E100#^^(#^#^#^#^#^#.......#^#^##)100 with 102 #s, let alone
E100#^^#^^#101.

Grand tethrarxitri
E100#^^#^^#100#2

Blistering blooshker bundle

E100#^^(#^^(blooshker bundle))^^#[blooshker bundle]100

Or E100#^^(#^#^#^#......^#)^^#(blooshker bundle) with blooshker bundle+2 #s.

Despite how amazing this sounds, it’s still less than even grand grand
tethrarxitri, or E100#^^#^^#100#3.
Hectastaculated-tethrato-tethrathoth
E100#^^(#^^#*#)100

Tethrato-tethrathothosquaror
E100#^^(#^^#*##)100

Tethrato-tethrathothocubor
E100#^^(#^^#*###)100

Tethrato-deutero-tethrathoth
E100#^^(#^^#*#^^#)100

Tethrato-tethrafact
E100#^^(#^^#)^#100

Tethrato-territethrathoth
E100#^^(#^^#)^^#100

Tethrato-tethriterator
E100#^^#^^#>#100

Not to be confused with E100(#^^#^^#)>#100. which is much smaller.

Tethrato-tethrasquare
E100#^^#^^##100

Tethrato-tethratope
E100#^^#^^#^#100

Brother-Giant
E100#^^#^#^^#^#100

Remember the Monster-Giant, which is constructed as E100(#^^#)^(#^^#)^#100? Well,

this is its brother, which is constructed the same as Monster-Giant, but with the
parentheses removed, which means that it’s computed as E100#^^(#^(#^^(#^#)))100.
This makes the number incomprehensibly larger. Brother-Giant is not significantly
bigger than tethrato-tethratope, because #^#^^#^# is not significantly more than
#^^#^#...at least from a googological point of view. It’s all too mind-boggling to
really speak of.

Tethrato-tethralattitope
E100#^^#^^#^##100
Tethrato-tethracubitope
E100#^^#^^#^###100

Tethrarxitet
E100#^^#^^#^^#100

Super-Brother-Giant
E100#^^#^#^^#^#^^#^#100

A further extension of the Brother-Giant.

Tethrarxipent
E100#^^^#5

Tethrarxihex
E100#^^^#6

Tethrarxihept
E100#^^^#7

Tethrarxi-ogd
E100#^^^#8

Tethrarxi-enn
E100#^^^#9

Tethrarxideck
E100#^^^#10

Tethrarxicose
E100#^^^#20

Tethrarxigole
E100#^^^#50

So now that that’s that ... how about some super incomprehensible higher-level
arrays? Welcome to the realm of the Mighty Royals! That class is most of the whole
gap between a humongulus and a golapulus, and THEN some.
PART 6: THE MIGHTY ROYALS
order type Γ0 to ψ(Ωw)
Here you will find some mind-boggling unspeakably huge numbers between order-types
of gamma-zero and ψ(Ωw) in the fast-growing hierarchy, such as the godsgodgulus and
TREE(3).

The Gamma Range

X^^^X ~ X^^^^X arrays
(order type Γ0 ~ φ(2,0,0))
Entries: 117
Pentacthulhum / tethrarxihect
E100#^^^#100
A pentacthulhum is the smallest of the pentational cases in Sbiis Saibian's
Extended Cascading-E. It's on the order of gamma-0 in the fast-growing hierarchy,
and it's comparable to Bowers' kungulus. Its name is a blend of "pentation",
"pentaculum", and "Cthulhu". It's described by Sbiis Saibian as a horrendously huge
number, but just the beginning of a whole new world of epic numbers!
Kungulus
X^^^100 & 10

This is Jonathan Bowers' kungulus, a mind-crushingly huge pentational array number,

much larger than a triakulus. Under the climbing method interpretation it's
comparable to Sbiis Saibian's pentacthulhum and of order type gamma-0.
fΓ0(100)
This entry serves as a place to discuss order type of gamma-zero (also known as the
Feferman-Schutte ordinal) in the fast-growing hierarchy. Like epsilon-zero, gamma-0
is another turning point in the fast-growing hierarchy - gamma-0 is the limit of
the 2-argument phi function (where φ(1,x) = epsilon-x, φ(2,x) = zeta-x, etc),
imaginable as
φ(φ(φ(........ .......,0),0),0),0) or as the first fixed point of α -> φ(α,0).
However, it can be expressed in terms of Veblen's multi-argument phi function
as φ(1,0,0), as θ(Ω) in the theta function, and as ψ(ΩΩ) in the psi function.
Gamma-0 is a good milestone point among infinite ordinals because it's that limit.
Tethrarxigigas
E100#^^^#500

Tethrarxichill
E100#^^^#1000
Pronounced tethrarxi-kill. The name comes from Greek chilias, meaning 1,000.
Tethrarximyr
E100#^^^#10,000
Tethrarxigong
E100#^^^#100,000

Pentacthulhugong
E100,000#^^^#100,000
This is a variant of a pentacthulhum. It’s really no significant difference from
tethrarxigong, as even E100#^^^#100,001 would be bigger than this! However, when we
expand it we can get a glimpse of the real gulf between those two relatively close
numbers:

E100#^^^#100,000 = E100#^^#^^# ... ... #^^#100 with 100 #s = E100#^^#^^ ... ...
#^#^#^# ... ^#100 with 199 #s

while E100,000#^^^#100,000 = E100,000#^^#^^# ... ... #^^#100,000 with 100,000 #s =

E100,000#^^#^^ ... ... #^#^#^# ... ^#100,000 with 199,999 #s - with the 100,000s
and the much higher hyperion tower at the end of the expanded-out pentacthulhugong,
we can get a glimpse of how far apart these two numbers really are. Moving on...
Tethrarxi-octad
E100#^^^#100,000,000
Great Wall
E100#^^#^^#>#^^#^^#>#^^#^^#.........>#^^#^^#100 with 10,000,000,000 #^^#^^#s
This irregular googolism has very strange behavior, as stated by Sbiis Saibian.
You’d expect this number to be in the same level as tethrarxitri. However, the
order of operations places this between tethrarxi-octad and tethrarxi-sedeniad!
Really, #^^#^^#>#^^#^^# is an unusual case, interpreted as #^^(#^^#>#^^#^^#) - it
messes with your mind to try to imagine it.
Tethrarxi-sedeniad
E100#^^^#10,000,000,000,000,000
Grand pentacthulhum
E100#^^^#100#2

Comparable to a kungulusplex.

Kungulusplex
X^^^kungulus & 10
This is the next recursive step from a kungulus. The next Bowerian googolism is a
quadrunculus.
Grangol-carta-pentacthulhum
E100#^^^#100#100
Pentacthulhutri
E100#^^^#100#^^^#100
Pentacthulhutet
E100#^^^#100#^^^#100#^^^#100
Pentacthulhu-by-hyperion
E100#^^^#*#100
Deutero-pentacthulhum
E100#^^^#*#^^^#100
Pentacthlhufact
E100(#^^^#)^#100
Terrible pentacthulhum
E100(#^^^#)^^#100
Terrisquared pentacthulhum
E100(#^^^#)^^##100
Territopo-pentacthlhum
E100(#^^^#)^^#^#100
Pentacthulutetripso-gridgahlah
E100(#^^^#)^^#^##100
Pentacthulhutetripso-godgathor
E100(#^^^#)^^#^#^#100
Pentacthulhutetripso-tethrathoth
E100(#^^^#)^^#^^#100
Pentacthulhutetripso-tethracross
E100(#^^^#)^^#^^##100
Pentacthulhutetripso-tethratope
E100(#^^^#)^^#^^#^#100
Pentacthulhutetripso-tethrarxitri
E100(#^^^#)^^#^^#^^#100
Dupentated-pentacthulhum
E100(#^^^#)^^(#^^^#)100

Terrible dupentated-pentacthulhum
E100((#^^^#)^^(#^^^#))^^#100
Terrisquared dupentated-pentacthulhum
E100((#^^^#)^^(#^^^#))^^##100
Dupentated-pentacthulhu-tetripso-godgahlah
E100((#^^^#)^^(#^^^#))^^#^#100
Dupentated-pentacthulhu-tetripso-tethrathoth
E100((#^^^#)^^(#^^^#))^^#^^#100
Dupentated-pentacthulhu-tetripso-pentacthulhum
E100((#^^^#)^^(#^^^#))^^(#^^^#)100
Tripentacthulated-pentacthulhum
E100(((#^^^#)^^(#^^^#))^^(#^^^#))^^(#^^^#)100
Quadrapentacthulated-pentacthulhum
E100(#^^^#)^^(#^^^#)>#4
Centempentacthulated-pentacthulhum
E100(#^^^#)^^(#^^^#)>#100

Godgahlah-turreted-pentacthulated-pentacthulhulhum
E100(#^^^#)^^(#^^^#)>#^#100
Tethrathoth-turreted-pentacthulated-pentacthulhulhum
E100(#^^^#)^^(#^^^#)>#^^#100
Pentacthulhum-turreted-pentacthulated-pentacthulhulhum
E100(#^^^#)^^(#^^^#)>#^^^#100
Dustaculated-dupentated-pentacthulhum
E100(#^^^#)^^(#^^^#)>(#^^^#)^^(#^^^#)100
Tristaculated-dupentated-pentacthulhum
E100(#^^^#)^^(#^^^#*#)3
Pentacthulhu-by-hyperia-tetrated-pentacthulhum
E100(#^^^#)^^(#^^^#*#)100

Pentacthulhu-deutero-pentacthulhutetrate
E100(#^^^#)^^(#^^^#*#^^^#)100
Pentacthulhu-trito-pentacthulhutetrate
E100(#^^^#)^^(#^^^#*#^^^#*#^^^#)100
Pentacthulhu-pentacthulhufacto-tetrate
E100(#^^^#)^^(#^^^#)^#100
Pentacthulhu-terripentacthulhu-tetrate
E100(#^^^#)^^(#^^^#)^^#100
This number somewhat resembles the Monster-Giant (E100(#^^#)^(#^^#)^#100).
Pentacthulhu-terrisquarorpentacthulhu-tetrate
E100(#^^^#)^^(#^^^#)^^##100
Tripentated-pentacthulhum
E100(#^^^#)^^(#^^^#)^^(#^^^#)100
Quadrapentated-pentacthulhum
E100(#^^^#)^^^#4
Pentacthuldugon / Horrible pentacthulhum
E100(#^^^#)^^^#100
Horrible is a prefix analogous to terrible, which pentates the number to 100. As
you can see the operator is much much more powerful than terrible, just as
pentating numbers themselves a long time ago quickly dwarfed tetrating them (e.g.
3^^^3 >>> 3^^3).
Pentacthultrigon / Double-horrible pentacthulhum
E100((#^^^#)^^^#)^^^#100
Pentacthultetragon / Triple-horrible pentacthulhum
E100#^^^#>#4
Pentacthulpentagon / Quadruple-horrible pentacthulhum
E100#^^^#>#5
Pentacthuliterator / Pentacthulhum ba’al
E100#^^^#>#100
This is iterator version of the pentacthulhum. It can also be called 99-ex-horrible
pentacthulhum.
Hugexul
200![200(1)200]
A hugexul is the smallest of Hollom's dimensional-array googolisms. It's comparable
to Sbiis Saibian's pentacthuliterator, and it's pronounced /huge-zul/.
Grand pentacthuliterator / Great and Horrible Pentacthulhum
E100#^^^#>#100#2
Or pentacthulhum ba’al-minus-one-ex-horrible pentacthulhum. Once again this is just
a single step in recursion from a pentacthuliterator.
Pentacthulditerator
E100#^^^#>(#+#)100
Pentacthulgriderator
E100#^^^#>##100
Dustaculated-pentacthulhum
E100#^^^#>#^^^#100
Pentacthulcross
E100#^^^##100

This number begins the second regiment of the pentational cases in Extended
Cascading-E.

Deutero-pentacthulhusquare
E100#^^^##*#^^^##100
Pentacthulhusquarorfact
E100(#^^^##)^#100
Terrible pentacthulhusquare
E100(#^^^##)^^#100
Terrisquared pentacthulhusquare
E100(#^^^##)^^##100
Territoped pentacthulhusquare
E100(#^^^##)^^#^#100
Tethrathothitetrated pentacthulhusquare
E100(#^^^##)^^#^^#100
Pentacthulhutetrated pentacthulhusquare
E100(#^^^##)^^#^^^#100
Dupentated-pentacthulhusquare
E100(#^^^##)^^(#^^^##)100
Tripentated-pentacthulhusquare
E100(#^^^##)^^^#3
Horrible pentacthulhusquare
E100(#^^^##)^^^#100

Horriterated pentacthulhusquare / hundred-ex-horrible pentacthulhusquare

E100(#^^^##)^^^#>#100
Dustaculated horripentacthulhusquare
E100(#^^^##)^^^#>(#^^^##)^^^#100
Tristaculated horripentacthulhusquare
E100(#^^^##)^^^#>(#^^^##)^^^#>(#^^^##)^^^#100
Horrisquared pentacthulhusquare / pentacthuldusquare
E100(#^^^##)^^^##100
Also called hectastaculated horripentacthulhusquare.
Pentacthultrisquare
E100((#^^^##)^^^##)^^^##100
Pentacthulhtetrasquare
E100#^^^##>#4
Pentacthulitersquare
E100#^^^##>#100
Dustaculated pentacthulhusquare
E100#^^^##>#^^^##100
Menger sponge
E(20)3###^^^###23
An irregular googolism coined by Sbiis Saibian, named after a fractal called the
Menger sponge.
A Menger sponge is formed the following way. First, take a cube and break it into a
3x3x3 set of identical cubes. Remove the center cube and the middle cube of each of
the six faces. There are 20 cubes total now. Now, do the same for each of the 20
cubes, making 400 cubes total. This continues with 8,000, 160,000, 3,200,000 ... ,
making it always a power of 20. This number is a very very very high-order Menger
sponge. It’s a gigantic power tower of 209s topped with a 3, and the way it begins
expanding when you solve it is like a Menger sponge, as parts of it always triple.
After a cerain point it begins to expand rapidly in length, but continues to expand
like a Menger sponge.
Pentacthulcubor
E100#^^^###100

Pentacthulteron
E100#^^^####100
Pentacthulpeton
E100#^^^#^#5
Pentacthulhexon
E100#^^^#^#6
Pentacthulhepton
E100#^^^#^#7
Pentacthul-ogdon
E100#^^^#^#8
Pentacthulennon
E100#^^^#^#9
Pentacthuldekon
E100#^^^#^#10
Pentacthultope
E100#^^^#^#100

We're almost done with the pentational cases of Extended Cascading-E now - this is
on the order of φ(1,w,0) in the fast-growing hierarchy.

Horrible pentacthultope
E100(#^^^#^#)^^^#100
Horrisquared pentacthultope
E100(#^^^#^#)^^^##100
Pentacthuldeutertope
E100(#^^^#^#)^^^#^#100
Pentacthultritotope
E100((#^^^#^#)^^^#^#)^^^#^#100
Pentacthulitertope
E100#^^^(#^#)>#100
Dustaculated-pentacthultope
E100#^^^(#^#)>#^^^(#^#)100
Tristaculated-pentacthultope
E100#^^^(#^#*#)3
Pentacthultopothoth
E100#^^^(#^#*#)100
Pentacthultoposquaror
E100#^^^(#^#*##)100
Pentacthultopodeus
E100#^^^(#^#*#^#)100
Pentacthultopotruce
E100#^^^(#^#*#^#*#^#)100
Pentacthultopoquad
E100#^^^(#^##)4
Pentacthulattitope
E100#^^^(#^##)100
Pentacthulcubitope
E100#^^^(#^###)100
Pentacthulquarticutope
E100#^^^(#^####)100
Pentacthulto-godgathor
E100#^^^#^#^#100
Pentacthulto-godtothol
E100#^^^#^#^#^#100
Pentacthulto-tethrathoth
E100#^^^#^^#100
Hectastaculated-pentacthulto-tethrhathoth
E100#^^^(#^^#*#)100
Pentacthulto-tethrathothibydeuteron
E100#^^^(#^^#*##)100
Pentacthulto-deutero-tethrathoth
E100#^^^(#^^#*#^^#)100
Pentacthulto-tethrafact
E100#^^^(#^^#)^#100
Pentacthulto-tethra-duliath
E100#^^^((#^^#)^(#^^#))100
Pentacthulto-territethrathoth
E100#^^^(#^^#)^^#100
Pentacthulto-tethriterator
E100#^^^(#^^#>#)100
Pentacthulto-tethracross
E100#^^^(#^^##)100
Pentacthulto-tethratope
E100#^^^(#^^#^#)100
Pentacthulto-tethrarxitri
E100#^^^(#^^#^^#)100
Pentacthularxitri
E100#^^^#^^^#100

Pentacthulto-pentacthuliterator
E100#^^^(#^^^#>#)100
Pentacthulto-pentacthulhusquare
E100#^^^#^^^##100
Pentacthulto-pentacthultope
E100#^^^#^^^#^#100
Pentacthularxitet
E100#^^^#^^^#^^^#100
Pentacthularxipent
E100#^^^#^^^#^^^#^^^#100
Pentacthularxihex
E100#^^^^#6
Pentacthularxideck
E100#^^^^#10
The Lower-Ternary-Phi Range
X^^^^X ~ {X,X,X} arrays
(order type φ(2,0,0) ~ φ(w,0,0))
Entries: 50
Hexacthulhum
E100#^^^^#100

This is the smallest of the hexational cases in Extended Cascading-E. It's of order
φ(2,0,0) in the fast-growing hierarchy, and it's comparable to a quadrunculus.
Quadrunculus
X^^^^100 & 10
This is a hexational array number coined by Jonathan Bowers - it's the only of his
hexational googolisms. The next Bowersism after this is a tridecatrix.
Grand hexacthulhum
E100#^^^^#100#2

Hexacthulhutri
E100#^^^^#100#^^^^#100
Deutero-hexacthulhum
E100#^^^^#*#^^^^#100
Hexacthulhufact
E100(#^^^^#)^#100

Terrible hexacthulhum
E100(#^^^^#)^^#100
Horrible hexacthulhum
E100(#^^^^#)^^^#100
Duhexated-hexacthulhum
E100(#^^^^#)^^^(#^^^^#)100
Trihexated-hexacthulhum
E100(#^^^^#)^^^(#^^^^#)^^^(#^^^^#)100
Hexadeucthulhum / horrendous hexacthulhum
E100(#^^^^#)^^^^#100

Hexatricthulhum / horrendous horrendous hexacthulhum

E100((#^^^^#)^^^^#)^^^^#100
Hexacthuliterator / hexacthulhum ba’al
E100#^^^^#>#100
Hugebixul
200![200(1)200(1)200]
The next main number of the hugexul group, comparable to hexacthuliterator.
Grand hexacthuliterator / Great and Horrendous Hexacthulhum
E100#^^^^#>#100#2
Dustaculated hexacthulhum
E100#^^^^#>#^^^^#100
Hexacthulhusquare
E100#^^^^##100
Horrendous hexacthulhusquare
E100(#^^^^##)^^^^#100
Dustaculated-horrenhexacthulhusquare
E100(#^^^^##)^^^^#>(#^^^^##)^^^^#100
Hexacthuldusquare / horrendosquar'ed hexacthulhum
E100(#^^^^##)^^^^##100
Hexacthulhusquarediterator
E100#^^^^##>#100
Dustaculated-hexacthulhusquare
E100#^^^^##>#^^^^##100
Hexacthulcubor
E100#^^^^###100
Hexacthulteron
E100#^^^^####100
Hexacthultope
E100#^^^^#^#100
Hectastaculated-hexacthultope
E100#^^^^(#^#*#)100
Hexacthultopodeus
E100#^^^^(#^#*#^#)100
Hexacthulattitope
E100#^^^^#^##100
Hexacthulcubitope
E100#^^^^#^###100
Hexacthulto-godgathor
E100#^^^^#^#^#100
Hexacthulto-tethrathoth
E100#^^^^#^^#100
Hexacthulto-pentacthulhum
E100#^^^^#^^^#100
Hexacthularxitri
E100#^^^^#^^^^#100
Hexacthularxitet
E100#^^^^#^^^^#^^^^#100
Heptacthulhum
E100#^^^^^#100
The multiple ^s are getting a bit much for our eyes to handle. Therefore we can use
#{x}# to mean #^^^....^^^# with x ^s. Therefore we can write out heptacthulhum as
E100#{5}#100. This is the start of using Bowers' extended operator notation.

Hugetrixul
200![200(1)200(1)200(1)200]
Comparable to heptacthuliterator.
Ogdacthulhum
E100#{6}#100
Hugequaxul
200![200(1)200(1)200(1)200(1)200]
In some time we’ll encounter the next next group, the enormaxul series. This is
comparable to ogdacthuliterator.
Ennacthulhum
E100#{7}#100
Dekacthulhum
E100#{8}#100
Tridecatrix
{10,10,10}&10

This number is a {10,10,10} array of 10’s. It's formed as a dodecational array, a

REALLY FUCKING BIG jump from a quadrunculus, being six more levels of up-arrow
recursion ... in the array structure itself!!! This number is insane, and Bowers
states that anyone trying to solve this will get hopelessly lost trying to sort out
the power structures! He's right on here there.
Goliath
E100#{10}#100 = E100#^^^^^^^^^^#100
Just imagine the mayhem of decomposing this horrendous number. It’s slightly larger
than the tridecatrix.
Golligog
E100#{50}#100

Evaluates to E100#^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^#100.
Humongulus
{10,10,100} & 10

A humongulus is equal to boogol array of 10s. It's so big that defining it requires
a generalized definition of {X,X,X} structures in BEAF, which isn't too hard to do.
However there’s a HUGE gap between this and the next Bowersism, called golapulus.
By huge I mean so huge that they’re nowhere near being even in the same realm of
numbers! Bowers was only able to make this GIGANTIC jump because of the cleverness
of his & operator. This gap is why I have made some of my own Bowers-style numbers
to fill the gap. Currently, no Saibianism reaches remotely as far as the golapulus
does!
Godsgodgulus
E100#{100}#100 = E100#{#}#100
Or
E100#^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^#100.
The obvious continuation to the -cthulhum numbers. This number, somewhat analogous
to the godgahlah and tethrathoth, is the breaking point of Extended Cascading-E and
the start of the work-in-progress Hyper-Extended Cascading-E, the fifth component
of Extensible-E. We’ll discover the delimiters after #{#}# when we get to their
respective numbers. When Hyper-Extended Cascading-E is complete, it wikll go
through all the higher arrays and maybe even legion arrays, and most definitely
surpass the golapulus.
As you probably can guess, E100#{#}#1 = godgahlah, E100#{#}#2 = tethrathoth,
E100#{#}#3 = pentacthulhum, E100#{#}#4 = hexacthulhum, E100#{#}#10 = goliath, etc.
#{#}# also gives a hint on what’s next to come.
Gigantorgog
E100#{500}#100 = E100#{#}#500
Simplifies to E100#^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^#100.
Godsgodgulusgong
E100,000#{100,000}#100,000 = E100,000#{#}#100,000
Just for fun, here is the gong version of the godsgodgulus, which Saibian does not
define. Having 100,000 ^s in the number instead of just 100, this is mind-
crushingly larger than the godsgodgulus.
Colossigog
E100#{50,000,000,000,000,000}#100 = E100#{#}#50,000,000,000,000,000
E100#^^^^.....^^^^100 with 50 QUADRILLION ^s! Writing those 50 quadrillion ^s by
hand would be hopeless, but storing it digitally is possible with large enough
space (on the scale of petabytes, keep in mind).
Grand godsgodgulus
E100#{godsgodgulus}#100 = E100#{#}#100#2
The next obvious continuation to the -cthulhum numbers, and a hint at what the
godsgodgulus group will bring.
Grand grand godsgodgulus
E100#{#}#100#3
The Higher-Ternary-Phi Range
{X,X,X} & a ~ {X,X,1,2} & a
(order type φ(w,0,0) ~ φ(1,0,0,0))
Entries: 155
Grangol-carta-godsgodgulus
E100#{#}#100#100
Just for the sake of it, I’ll drag through the preliminaries to show just how far
we’ve come from the grand godgahlahgong, the tethrathoth, and the great and
terrible tethrathoth.
Grand grangol-carta-godsgodgulus
E100#{#}#100#100#2
Greagol-carta-godsgodgulus
E100#{#}#100#100#100
Gigangol-carta-godsgodgulus
E100#{#}#100#100#100#100
Gugolda-carta-godsgodgulus
E100#{#}#100##100
Graatagolda-carta-godsgodgulus
E100#{#}#100##100#100
Greegolda-carta-godsgodgulus
E100#{#}#100##100#100#100
Grinningolda-carta-godsgodgulus
E100#{#}#100##100#100#100#100
Gugolthra-carta-godsgodgulus
E100#{#}#100##100##100
Gugoltesla-carta-godsgodgulus
E100#{#}#100##100##100##100
Throogol-carta-godsgodgulus
E100#{#}#100###100
Throotrigol-carta-godsgodgulus
E100#{#}#100###100###100
Tetroogol-carta-godsgodgulus
E100#{#}#100####100
Pentoogol-carta-godsgodgulus
E100#{#}#100#####100
Hexoogol-carta-godsgodgulus
E100#{#}#100######100
Heptoogol-carta-godsgodgulus
E100#{#}#100#######100
Ogdoogol-carta-godsgodgulus
E100#{#}#100########100
Godgahlah-carta-godsgodgulus
E100#{#}#100#^#100
Grandgahlah-carta-godsgodgulus
E100#{#}#100#^#100#100
Greagahlah-carta-godsgodgulus
E100#{#}#100#^#100#100#100
Gotrigahlah-carta-godsgodgulus
E100#{#}#100#^#100#^#100
Godgoldgahlah-carta-godsgodgulus
E100#{#}#100#^#*#100
Godthroogahlah-carta-godsgodgulus
E100#{#}#100#^#*##100
Deutero-godgahlah-carta-godsgodgulus
E100#{#}#100#^#*#^#100
Trito-godgahlah-carta-godsgodgulus
E100#{#}#100#^#*#^#*#^#100
Teterto-godgahlah-carta-godsgodgulus
E100#{#}#100#^#*#^#*#^#*#^#100
Dekato-godgahlah-carta-godsgodgulus
E100#{#}#100#^##10
Gridgahlah-carta-godsgodgulus
E100#{#}#100#^##100
Deutero-gridgahlah-carta-godsgodgulus
E100#{#}#100#^##*#^##100
Kubikahlah-carta-godsgodgulus
E100#{#}#100#^###100
Quarticahlah-carta-godsgodgulus
E100#{#}#100#^####100
Quinticahlah-carta-godsgodgulus
E100#{#}#100#^#####100
Decicahlah-carta-godsgodgulus
E100#{#}#100#^#^#10
Godgathor-carta-godsgodgulus
E100#{#}#100#^#^#100
Deutero-godgathor-carta-godsgodgulus
E100#{#}#100#^#^#*#^#^#100
Hecato-godgathor-carta-godsgodgulus
E100#{#}#100#^(#^#*#)100
Godgridgathor-carta-godsgodgulus
E100#{#}#100#^(#^#*##)100
Godkubikathor-carta-godsgodgulus
E100#{#}#100#^(#^#*###)100
Godquarticathor-carta-godsgodgulus
E100#{#}#100#^(#^#*####)100
Godgathordeus-carta-godsgodgulus
E100#{#}#100#^(#^#*#^#)100
Godgathortruce-carta-godsgodgulus
E100#{#}#100#^(#^#*#^#*#^#)100
Godgathorquad-carta-godsgodgulus
E100#{#}#100#^(#^#*#^#*#^#*#^#)100
Gralgathor-carta-godsgodgulus
E100#{#}#100#^#^##100
Gralgathordeus-carta-godsgodgulus
E100#{#}#100#^(#^##*#^##)100
Gralgathortruce-carta-godsgodgulus
E100#{#}#100#^(#^##*#^##*#^##)100
Gralgathorquad-carta-godsgodgulus
E100#{#}#100#^(#^##*#^##*#^##*#^##)100
Thraelgathor-carta-godsgodgulus
E100#{#}#100#^#^###100
Terinngathor-carta-godsgodgulus
E100#{#}#100#^#^####100
Godtothol-carta-godsgodgulus
E100#{#}#100#^#^#^#100
Graltothol-carta-godsgodgulus
E100#{#}#100#^#^#^##100
Godtertathol-carta-godsgodgulus
E100#{#}#100#^#^#^#^#100
Godpeptathol-carta-godsgoldgulus
E100#{#}#100#^#^#^#^#^#100
Tethrathoth-carta-godsgodgulus
E100#{#}#100#^^#100
Tethratrithoth-carta-godsgodgulus
E100#{#}#100#^^#100#^^#100
Tethrathoth-by-hyperion-carta-godsgodgulus
E100#{#}#100#^^#*#100
Deutero-tethrathoth-carta-godsgodgulus
E100#{#}#100#^^#*#^^#100
Trito-tethrathoth-carta-godsgodgulus
E100#{#}#100#^^#*#^^#*#^^#100
Tethrafact-carta-godsgodgulus
E100#{#}#100(#^^#)^#100
Grideutertethrathoth-carta-godsgodgulus
E100#{#}#100(#^^#)^##100
Cubicutethrathoth-carta-godsgodgulus
E100#{#}#100(#^^#)^###100
Tethragodgathor-carta-godsgodgulus
E100#{#}#100(#^^#)^#^#100
Tethraduliath-carta-godsgodgulus
E100#{#}#100(#^^#)^(#^^#)100
Tethrathruliath-carta-godsgodgulus
E100#{#}#100(#^^#)^(#^^#*#^^#)100
Tethraterliath-carta-godsgodgulus
E100#{#}#100(#^^#*#^^#*#^^#)100
Monster-Giant-carta-godsgodgulus
E100#{#}#100(#^^#)^(#^^#)^#100
Tethrathoth-trebletetrate-carta-godsgodgulus
E100#{#}#100(#^^#)^(#^^#)^(#^^#)100
Super Monster-Giant-carta-godsgodgulus
E100#{#}#100(#^^#)^(#^^#)^(#^^#)^#100
Terrible tethrathoth-carta-godsgodgulus
E100#{#}#100(#^^#)^^#100
Terrible terrible tethrathoth-carta-godsgodgulus
E100#{#}#100((#^^#)^^#)^^#100
Tethriterator-carta-godsgodgulus
E100#{#}#100#^^#>#100
Tethriditerator-carta-godsgodgulus
E100#{#}#100#^^#>(#+#)100
Tethrigriditerator-carta-godsgodgulus
E100#{#}#100#^^#>##100
Dustaculated-tethrathoth-carta-godsgodgulus
E100#{#}#100#^^#>#^^#100
Tristaculated-tethrathoth-carta-godsgodgulus
E100#{#}#100#^^#>#^^#>#^^#100
Tethracross-carta-godsgodgulus
E100#{#}#100#^^##100
Tethracubor-carta-godsgodgulus
E100#{#}#100#^^###100
Tethrateron-carta-godsgodgulus
E100#{#}#100#^^####100
Tethratope-carta-godsgodgulus
E100#{#}#100#^^#^#100
Tethratopodeus-carta-godsgodgulus
E100#{#}#100#^^(#^#*#^#)100
Tethralattitope-carta-godsgodgulus
E100#{#}#100#^^#^##100
Tethracubitope-carta-godsgodgulus
E100#{#}#100#^^#^###100
Tethrato-godgathor-carta-godsgodgulus
E100#{#}#100#^^#^#^#100
Tethrato-godtothol-carta-godsgodgulus
E100#{#}#100#^^#^#^#^#100
Tethrarxitri-carta-godsgodgulus
E100#{#}#100#^^#^^#100
Tethrarxitet-carta-godsgodgulus
E100#{#}#100#^^#^^#^^#100
Pentacthulhum-carta-godsgodgulus
E100#{#}#100#^^^#100
Pentacthuldugon-carta-godsgdgulus
E100#{#}#100(#^^^#)^^^#100
Pentacthuliterator-carta-godsgodgulus
E100#{#}#100#^^^#>#100
Dustaculated-pentacthulhum-carta-godsgodgulus
E100#{#}#100#^^^#>#^^^#100
Pentacthulhusquare-carta-godsgodgulus
E100#{#}#100#^^^##100
Pentacthulcubor-carta-godsgodgulus
E100#{#}#100#^^^###100
Pentacthulteron-carta-godsgodgulus
E100#{#}#100#^^^####100
Pentacthultope-carta-godsgodgulus
E100#{#}#100#^^^#^#100
Pentacthularxitri-carta-godsgodsgulus
E100#{#}#100#^^^#^^^#100
Hexacthulhum-carta-godsgodgulus
E100#{#}#100#^^^^#100
Heptacthulhum-carta-godsgodgulus
E100#{#}#100#^^^^^#100

Godsgodgulus-by-deuteron
E100#{#}#100#{#}#100
Godsgodgulus-by-triton
E100#{#}#100#{#}#100#{#}#100
Godsgodgulus-by-teteron
E100#{#}#100#{#}#100#{#}#100#{#}#100
Godsgodgulus-by-hyperion
E100#{#}#*#100
Godsgodgulus-by-deuterohyperion
E100#{#}#*##100
Godsgodgulus-by-tritohyperion
E100#{#}#*###100
Godsgodgulus-by-godgahlah
E100#{#}#*#^#100
Godsgodgulus-by-tethrathoth
E100#{#}#*#^^#100
Godsgodgulus-by-pentacthulhum
E100#{#}#*#^^^#100
Godsgodgulus-by-hexacthulhum
E100#{#}#*#^^^^#100

Deutero-godsgodgulus
E100#{#}#*#{#}#100
Trito-godsgodgulus
E100#{#}#*#{#}#*#{#}#100
Teterto-godsgodgulus
E100#{#}#*#{#}#*#{#}#*#{#}#1000
Pepto-godsgodgulus
E100(#{#}#)^#5
Exto-godsgodgulus
E100(#{#}#)^#6
Dekato-godsgodgulus
E100(#{#}#)^#10

Godsgodgulfact
E100(#{#}#)^#100
Terrible godsgodgulus
E100(#{#}#)^^#100
Horrible godsgodgulus
E100(#{#}#)^^^#100
Horrendous godsgodgulus
E100(#{#}#)^^^^#100

Godsgodeugulus
E100(#{#}#){#}#100
Godsgotrigulus
E100((#{#}#){#}#){#}#100
Godsgodguliterator / godsgodgulus ba’al
E100#{#}#>#100

The iterator version of a godsgodgulus. Note that this is MUCH larger than just
E100#{100}#>#100.
Grand godsgodguliterator / Great and Blasphemous Godsgodgulus
E100#{#}#>#100#2

Dustaculated-godsgodgulus
E100#{#}#>#{#}#100
Tristaculated-godsgodgulus
E100#{#}#>#{#}#>#{#}#100

Godsgodgulcross
E100#{#}##100

Godsgodgulcubor
E100#{#}###100
Godsgodgulteron
E100#{#}####100
Godsgodgultope
E100#{#}#^#100
Godsgodgulto-tethrathoth
E100#{#}#^^#100
Godsgodgulto-pentacthulhum
E100#{#}#^^^#100
Godsgodgulto-hexacthulhum
E100#{#}#^^^^#100
Godsgodgularxitri
E100#{#}#{#}#100
Godsgodgularxitet
E100#{#}#{#}#{#}#100
We can continue from {#} using an operator, {#+1}. We can have some new cool
numbers from here.
Godsgodgularxihect / Godsgodgulhenus
E100#{#+1}#100
All these next number names are coined by me. Saibian lists them, but gives no
name.
Godsgodgulhencross
E100#{#+1}##100
Godsgodgulhentope
E100#{#+1}#^#100
Godsgodgulhenarxitri
E100#{#+1}#{#+1}#100
Godsgodgulhenarxihect / Godsgodguldius
E100#{#+2}#100
Simple, right? We can quite esily take ll this to new directions...
Godsgodgultrius
E100#{#+3}#100
Godsgodgulterus
E100#{#+4}#100
The series continues with godsgodgulpetus, -exus, -eptus, -ogdus, -ennus, and -
dekus. Then we can have...
Secundo-godsgodgulus
E100#{#+#}#100
This is a neat number. The first step of decomposing this down is sort of like the
godsgodgulus, but done twice. Of course, then we can digonalize over THAT with...
Tertio-godsgodgulus
E100#{#+#+#}#100
Quarto-godsgodgulus
E100#{#+#+#+#}#100
Then we can have quinto-, sexto-, septimo-, octavo-, novo-, and decimo-
godsgodgulus. With a sum of 20 #s, we can even have a vigemo-godsgodgulus.
Godsgridgulus / Centimo-godsgodgulus
E100#{##}#100
Decomposes to E100#{#+#+#+#+#......100 #s........#+#+#+#+#}#100. What’s better then
that?
Secundo-godsgridgulus
E100#{##+##}#100
Tertio-godsgridgulus
E100#{##+##+##}#100
Quarto-godsgridgulus
E100#{##+##+##+##}#100
Godskubikulus
E100#{###}#100
Godsquarticulus
E100#{####}#100
Centurion
E100#{#^#}#100
Here’s a neat number - it decomposes to E100#{####....(100 #s)....####}#100. This
next number should be straightforward:
Super centurion
E100#{#^^#}#100
Decomposes to E100#{#^#^#^#.....(100 #s).....#^#^#^#}#100.
Pentacthulhu-centurion
E100#{#^^^#}#100
Hexacthulhu-centurion
E100#{#^^^^#}#100

Ohmygosh-ohmygosh-ohmygooosh / Godsgodgul-centurion
E100#{#{#}#}#100

Evaluates to E100#{#^^^ ... (100 ^s) ... ^^^#}#100.

Ohmygosh-ohmygosh-ohmygosh-ohmygooosh
E100#{#{#{#}#}#}#100
Ohmygosh-ohmygosh-ohmygosh-ohmygosh-ohmygooosh
E100#{#{#{#{#}#}#}#}#100
The Multi-Argument-Phi Range
{X,X,1,2} & a ~ {X,X(1)2} & a
(order type φ(1,0,0,0) ~ ψ(ΩΩ^w)
Entries: 54
Blasphemorgulus
E100#{#{#{#{#{# ... {#{#}#} ... #}#}#}#}#}#100 with 100 #s from the center to one
end out
This horrifyingly large number is comparable to a {X,X,1,2} array of 100’s, and is
of order type φ(1,0,0,0) in the fast growing hierarchy. φ(1,0,0,0) is also
expressible as θ(Ω2) in the theta function and ψ(ΩΩ^2) in the psi function and it's
known as the Ackermann ordinal.
We’ve exhaused Hyper-Extended Cascading-E...so where to go from here? Saibian
defines this as E100{#,#,1,2}100 as the start of hyperion-arrays, but plans on
having them grow very quickly, and thus after a bit of blasphemorgulus extensions,
he develops some more ad hoc experimental notations, and says they still only make
a little bit of progress in hyperion-arrays. He does give planned constructions,
most of them with names, and I will develop my own way to go a little bit through
hyperion tetrentricals in this list.
So I define the blasphemorgulus with my notation as E100#{{1}}#100, borrowing
Bowers’ extended operator notation. Get ready for some new giants ...
Gonguldeus
{X,100,1,2} & 10
This is a number I coined comparable to a blasphemorgulus. It is an expansional-
array level number, and it's of order of the Ackermann ordinal.
Grand blasphemorgulus
E100#{{1}}#100#2
Grand grand blasphemorgulus
E100#{{1}}#100#3
Grangol-carta-blsphemorgulus
E100#{{1}}#100#100
Blasphemorgulus-by-deuteron
E100#{{1}}#100#{{1}}#100

Blasphemorgulus-by-hyperion
E100#{{1}}#*#100
Deutero-blasphemorgulus
E100#{{1}}#*#{{1}}#100
Blasphemorgulfact
E100(#{{1}}#)^#100
Terrible blasphemorgulus
E100(#{{1}}#)^^#100
Horrible blasphemorgulus
E100(#{{1}}#)^^^#100
Horrendous blasphemorgulus
E100(#{{1}}#)^^^^#100
Godsgoblasphemorgulus
E100(#{{1}}#){#}#100
Ohmygosh-ohmygosh-ohmygoblasphemorgulus
E100(#{{1}}#){#{#}#}#100
E100(#{{1}}#){#{{1}}#}#100
Or E100(#{{1}}#){X}#100 where X is the blasphemorgulus array. But no, this is not
equal to E100#{{1}}#>#2 - that’s a higher construction which will be seen in a bit.
Moving on...
Blasphemormygosh-blasphemormygosh
E100(#{{1}}#){#{{1}}#}(#{{1}}#)100
Blasphemormygosh-blasphemormygosh-blasphemormygosh
E100(#{{1}}#){(#{{1}}#){#{{1}}#}(#{{1}}#)}(#{{1}}#)100
Whoa now. This is starting to get messy. If this is hard to read, it’s equal to
E100A{A{A}A}A100 where A is (#{{1}}#).
But this is itself the start of a new sequence - let (a){{1}}#x mean a{a{a...
{a{a}a}...a}a}a with x a’s from the center out. So this is also equal to
E100(#{{1}}#){{1}}#3. As you can see we’re starting to get into iterating the
blasphemorgulus, but in a slightly different way that we’re used to.
Blasphedeumorgulus / tweilasphemorgue
E100(#{{1}}#){{1}}#100

Blasphetrimorgulus / freilasphemorgue
E100((#{{1}}#){{1}}#){{1}}#100
The series continues with fioril-, finn-, sex-, sjornal-, attal-, neiul-, and
tenasphemorgue, then we can skip to:
Hunderlasphemorgue / blasphemorguliterator
E100#{{1}}#>#100
Saibian defines this as equal to E100{#,#+1,1,2}100 (which matches with his idea of
the climbing method), but all the next Extended Cascading-E numbers are my own
definitions.
Enormaxul
200![200(2)200]
The next major HAN number - comparable to blsphemorguliterator. As you can see HAN
is amazingly powerful, and it has a lot more awesomeness coming our way.
Blasphemorgulditerator
E100#{{1}}#>(#+#)100
Dustaculated-blasphemorgulus
E100#{{1}}#>#{{1}}#100
Hectastaculated-blasphemorgulus
E100#{{1}}#>#{{1}}#> ... ... ... >#{{1}}#100, 100 #{{1}}#s
Now this is as far as I’ve developed my extension to Extended Cascading-E - it's
most likely equal to E100#{{1}}##100, though I can't say with certainty. It is
needless to say that Sbiis Saibian will eventually decide on something of his own
when he gets his whole hyperion array space theory done. We could continue with:
Grand hectastaculated-blasphemorgulus
E100#{{1}}#>#{{1}}#> ... ... ... ... ... ... >#{{1}}#100, hectastaculated-
blasphemorgulus #{{1}}#s
... and then resort to only other notations, like BEAF, hyperfactorial array
notation, and the fast-growing hierarchy.
Gongultreus
{X,100,1,3} & 10
This is another number I coined with the array-of operator. It's much larger than
any of my extensions to the blasphemorgulus.
Enormabixul
200![200(2)200(2)200]
Comparable to an {X,X^2,1,3} array.
Gongulquadeus
{X,100,1,4} & 10
Enormatrixul
200![200(2)200(2)200(2)200]
Comparable to to an {X,X^2,1,4} array.
Enormaquaxul
200![200(2)200(2)200(2)200(2)200]
Comparable o an {X,X^2,1,5} array.
200![200(3)200]

Another unnamed HAN number - arrays with (3)s are comparable to 5-entry array
arrays. This is comparable to an {X,X^2,1,1,2} array of 200s.
Generatrix
{10,10,10,10} & 10
How incredible is this array of 10’s (which I coined)? Insane beyond belief, and
its name was extrapolated from the analogy,tridecal:tridecaltrix::general:?
Incredulus
{10,10,10,100} & 10
Another number I coined, which is a whopping troogol array of 10’s!!! This number
is about the breaking point of tetrentrical arrays.
Incridulus
{10,10,10,100,2} & 10
Incradulus
{10,10,10,100,3} & 10
Increedulus
{10,10,10,100,4} & 10
Pentadecatrix
{10,10,10,10,10} & 10
Tercredulus
{10,10,10,10,100} & 10
A quadroogol array of tens.

Tercridulus
{10,10,10,10,100,2} & 10

Tercradulus
{10,10,10,10,100,3} & 10

Tercreedulus
{10,10,10,10,100,4} & 10
Pencredulus
{10,10,10,10,10,100} & 10

Excredulus
{10,10,10,10,10,10,100} & 10

Epcredulus
{10,10,10,10,10,10,10,100} & 10

Ogcredulus
{10,10,10,10,10,10,10,10,100} & 10

Iteratrix
{10,10(1)2} & 10 = 10&10&10

This number is an iteral array of tens which can be expressed as 10&10&10 or

alternately as {10,3/2} (see also the entry for a triakulus in part 5) since
{a,b/2} = a&a&a......&a with b a's.
Goobawamba
{10,100(1)2} & 10
This number is a goobol array of tens, a number of order type ψ(ΩΩ^w) (also known
as the small Veblen ordinal, or SVO for short). It's about as far as I myself
currently have figured out how to easily define BEAF with the array of operator.
I'm not exactly sure how to go further, because (for example) setting {X,2X(1)2} =
{{X,X(1)2},X(1)2} just doesn't work.
Why is that? The whole reason I chose, for example, X^^2X = (X^^X)^^X is because
n^^2n (where n is a number) APPROXIMATES (n^^n)^^n - the same holds true, for
example, when comparing n{{1}}2n vs (n{{1}}n){{1}}n. However, {{n,n(1)2},n(1)2} is
NOT EVEN CLOSE to {n,2n(1)2} - this shows that defining the structures is now much
harder at this point.
Fortunately, Hyp cos of Googology Wiki has an "analysis" of BEAF in terms of the
FGH, which gives informal proposals on how big BEAF numbers "should" be in terms of
the FGH. What he does is not only a full coverage of BEAF, but it's also helpful
for determining how to work with BEAF past {X,X(1)2} & a. The methods for getting
to things like {X,X,2(1)2} & a are kind of confusing, but they're reasonably
unproblematic.
I'm currently trying to figure out how to work with BEAF past the SVO. But for now,
from here on out, in BEAF numbers I will rely on Hyp cos's "analysis" for determing
how big they are. I put "analysis" in quotation marks because the analysis isn't
very formal (BEAF past dimensional arrays in itself isn't formal), and it's better
to describe it as an informal proposal on how big BEAF numbers "should" be and how
BEAF "should" be worked with past tetration arrays.

fψ(Ω^Ω^w)(100)

This is a number used to discuss order type ψ(ΩΩ^w) in the fast-growing hierarchy.

It's about {X,102(1)2}&100 in BEAF, with the array of operator. ψ(ΩΩ^w) is often
called the small Veblen ordinal, usually abbreviated to SVO. That ordinal can be
thought of as φ(.......,0,0,0,0,0) since it represents the limit of the multi-
argument phi function, and after this point you need to use ordinal collapsing
functions, either the theta function or the psi function. I opt for the psi
function because it's both simpler and more wide-ranged. But I should point out
that there are several ways one can define the psi function, so in this list I will
use the most common variant, the Bachmann psi function which is limited at the
mysterious Takeuti-Feferman-Buchholz ordinal.
The small Veblen ordinal is another classic benchmark point in the FGH - for
example it represents what is believed to be the growth rate of Bowers' linear
array-arrays, and according to Sbiis Saibian (through communication) it will be the
growth rate of hyperion linear-arrays when they're released. This ordinal is also
the growth rate of Hollom's hyperfactorial dimensional arrays. Like epsilon-zero,
the SVO is another point where googological functions become harder to work with
and define. For discussion of this kind of thing in BEAF, see the previous entry.
Destruxul
200![200(200)200]

This is another number of order type of the small Veblen ordinal in the FGH. It is
a number coined by Lawrence Hollom, and lies at the limit of linear array-arrays.
It opens up a whole new realm of crazy hyperfactorial arrays, starting with making
the number in parentheses itself an array.

The-Veblen-Bachmann-Ordinal Range
{X,X(1)2} & a ~ X^^X & X & a
(order type ψ(ΩΩ^w) ~ ψ(εΩ+1)
Entries: 51
Lower bound for TREE(3)
~ fψ(Ω^(Ω^w*w))(3)
This is a lower-bound for the famous number TREE(3), arguably the most famous
number larger than Graham's number. It is notable because it is a number used in
serious mathematics that is (far) larger than the "record-holder" Graham's number.
It was discovered by mathematician Harvey Friedman from a problem in graph theory.
Friedman has worked with mathematical sequences in graph theory and other fields
that lead to some really big numbers. I have met Harvey Friedman in person before -
at the time I was in fourth grade and I was invited to a sort of mathematics
gathering at a nearby university. I have a picture with me, him, and the
university's president in my bedroom to this day, with Friedman's signature.
The most famous sequence Friedman has studied is the TREE sequence, which arises
out of a problem in graph theory. The problem asks how long a sequence of k-labeled
trees can be such that no tree is homeomorphically embeddable into a previous tree.
Kruskai's tree theorem tells us that such a sequence must be finite, but how long
can such sequences get? TREE(k) is the maximum length of such a sequence of k-
labeled trees. TREE(1) is equal to 1, TREE(2) is equal to 3, but TREE(3) explodes
to a number that is INSANELY huge, undescribably larger than Graham's number.

Unlike Graham's number TREE(3) is not an upper-bound to the solution of a problem -

it IS the solution to a problem. Therefore, really TREE(3) is a better example of a
number used in serious mathematics than Graham's number, as it's not merely the
smallest number that mathematicians could prove to be greater than the solution to
a problem, but it is itself the unfathomably enormous solution to a problem.
Even by googological standards TREE(3) is quite sizable. It's not huge in the way a
googolplex or Graham's number or even a GONGULUS is - none of those three numbers
come even close to TREE(3)!!! It utterly leaves Graham's number way behind in a
land of weeny tiny baby numbers because it's just so huge. While Graham's number is
very easy to describe in terms of googological functions, TREE(3) is quite
difficult to describe in googological functions. Functions that can approximate or
bound TREE(3) are at such a high level that they are rather esoteric, because
TREE(3) is just that big. While Graham's number is very easy to surpass with large
number notations, TREE(3) is very difficult to surpass - therefore TREE(3) can be
actually seen as a very large number in a whole new way, because it isn't easy to
make a number this big.

At this point the most common way to approximate numbers is BY FAR the fast-growing
hierarchy. The fast-growing hierarchy, as we saw earlier in the list, has a fairly
simple definition but is very powerful. However, at this point even the fast-
growing hierarchy is pretty difficult to understand, and requires a good amount of
knowledge in googology, and a good amount of imagination.
TREE(n) has a growth rate comparable to at least fψ(Ω^(Ω^w*w))(n), making it pass
the small Veblen ordinal in the fast-growing hierarchy. An upper bound for the
growth rate is not known, but TREE(n) is believed to be in the ballpark of
fψ(Ω^(Ω^w*w))(n), and in terms of Bowers' named numbers it's believed to be within
the vast gap between a humongulus and a golapulus.
Incredibly, TREE(3) is still not the largest number that has been used in
professional mathematics. There are even more powerful sequences that have been
studied by Friedman and other mathematicians - one such sequence is Friedman's SCG
sequence leading to a number even bigger than TREE(3) known as SCG(13) (seen later
on the list).

Lower bound for SSCG(3)

~ fϑ(Ω^ω^2,φ(ω^2*4,0,0))(3)

This is a lower bound for SSCG(3) wth the SSCG function, a sibling of Harvey
Friedman's SCG function. Hyp cos of Googology Wiki proved this bound, which is far
larger than SSCG(0) = 1, SSCG(1) = 5, and SSCG(2) ~> 10^10^28.
Destrubixul
200![200([200(200)200])200]

A googolism by Lawrence Hollom. Comparable to fα(200), where α is ψ(ΩΩ^ψ(Ω^Ω^w)).

If interpreted one way this means that this number is equal to about
{X,X(1)2}&200&200, but if interpreted the other way (which i prefer) it's about {X,
{X,X(1)2}(1)2}&200 - for more on that, and why I prefer the second way, see the
entries for a gibbawamba and fψ(Ω^Ω^Ω)(100).

Destrutrixul
200![200([200([200(200)200])200])200]

Comparable to fα(200), where α is ψ(ΩΩ^ψ(Ω^Ω^ψ(Ω^Ω^w))). If interpreted one way

this means that this number is equal to about {X,X(1)2}&200&200&200, but if
interpreted the other way (which i prefer) it's about {X,{X,{X,X(1)2}(1)2}
(1)2}&200.

Destruquaxul
200![200([200([200([200(200)200])200])200])200]

Continuing the pattern. This number is comparable to fα(200), where α is

ψ(ΩΩ^ψ(Ω^Ω^ψ(Ω^Ω^ψ(Ω^Ω^w)))). If interpreted one way this means that this number is
equal to about {X,X(1)2}&200&200&200&200, but if interpreted the other way (which i
prefer) it's about {X,{X,{X,{X,X(1)2}(1)2}(1)2}(1)2}&200. Either way, this doesn't
quite reach the large Veblen ordinal (ψ(ΩΩ^Ω)) (see two entries later).

Gibbawamba
{X,100,2(1)2} & 10

This is a number I coined that continues the pattern of dimensional array-arrays -

the value is believed to be at the order type of the large Veblen ordinal in the
fast growing hierarchy (see next entry).
fψ(Ω^Ω^Ω)(100)

This is yet another fast-growing hierarchy number used to discuss an order type, in
this case ψ(ΩΩ^Ω), known as the large Veblen ordinal or LVO for short. ψ(ΩΩ^Ω) is
the fixed point of α->ψ(ΩΩ^α) and can be imagined
as ψ(ΩΩ^ψ(Ω^Ω^ψ(Ω^Ω^....... ......)))). In googology, this order type is most
notable for being part of a debate regarding BEAF: is {n,n/2} of order type ψ(ΩΩ^Ω)
or ψ(Ωw) in the fast-growing hierarchy? in the second case, ψ(ΩΩ^Ω) is only about
{X,X,2(1)2} & n.

I prefer the ψ(Ωw) = {n,n/2} idea for two reasons. The first reason is pretty
obvious: it is a more powerful interpretation of BEAF - since people in googology
generally want their notations to be as powerful as they can make it, I think the
second interpretation is the one Bowers himself (the creator of BEAF) is more
likely to choose. But the second reason is a bit more controversial: the ψ(Ωw) =
{n,n/2} idea seems more widely accepted than the ψ(ΩΩ^Ω) = {n,n/2} idea. Though
neither is a totally certain interpretation, I choose the second largely because
analyses of BEAF such as Hyp cos's seem to use that idea, and there are no analyses
as extensive with the other ψ(ΩΩ^Ω) = {n,n/2} idea.

All this goes to show that BEAF's ambiguity is a real problem, and a highly
reflected one since ψ(Ωw) is so much larger than the LVO, yet both are different
interpretations of the same structure. And we still haven't reached a golapulus
yet....unless we use the other approach (which I'm not using) where a golapulus
would be of order type ψ(ΩΩ^w^w) instead of ψ(ΩΩ^Ω^w). Note that in the alternate
case a golapulus would be smaller than a destrubixul, while in the case I'm using a
golapulus would surpass anything in the destruxul family.

Now let's move on to some more BEAF constructions with their interpretations in
terms of the FGH, with my idea.

Gabbawamba
{X,100,3(1)2} & 10

Boobawamba
{X,X,100(1)2} & 10

Troobawamba
{X,X,X,100(1)2} & 10

Goobawantra
{X,100(1)3} & 10

Note that I'm taking some liberty in naming the numbers just to make the names
sound good.

Emperatrix
{X,X(1)10} & 10
Gossablossla
{X,X(1)100} & 10

Hyperlatrix
{X,X(1)X,10} & 10

Goobaduamba
{X,100(1)(1)2} & 10

Can be imagined {10,10...[100 10's]...10,10(1)10,10...[100 10's]...10,10} & 10.

Goobatriombia
{X,100(1)(1)(1)2} & 10

Goobaquardimbia
{X,100(1)(1)(1)(1)2} & 10

Goobaquindingia
{X,100(1)(1)(1)(1)(1)2} & 10

Goobasesixtia
{X,100(1)(1)(1)(1)(1)(1)2} & 10

Goobasebiptia
{X,100(1)(1)...[7 (1)s]...(1)(1)2} & 10

Goobagogdiktia
{X,100(1)(1)...[8 (1)s]...(1)(1)2} & 10

Goobanogdiktia
{X,100(1)(1)...[9 (1)s]...(1)(1)2} & 10

Xaplorgulus
{X,X(2)2} & 10

A number I coined equal to a xappol array of tens. It's about fθ(Ω^w^2)(10) in the

fast-growing hierarchy by Hyp cos's analysis. It's not too far from a golapulus
anymore, if by not too far you mean we only have 98 more dimensions in the array
used to define the array of a golapulus to go.

Goobadektimtia
{X,100(1)(1)...[10 (1)s]...(1)(1)2} & 10

Goxxablorg
{X,100(2)2} & 10

Based on Sbiis Saibian's array notation number called goxxol, which has an entry in
part 5.

Gooxadworg
{X,100(2)(2)2} & 10

Goxxathrorg
{X,100(2)(2)(2)2} & 10

Goxxaquorg
{X,100(2)(2)(2)(2)2} & 10

Cosslorgulus
{X,X(3)2} & 10

A coloxxol array of tens.

Tesslorgulus
{X,X(4)2} & 10

Pesslorgulus
{X,X(5)2} & 10

Hesslorgulus
{X,X(6)2} & 10

Zesslorgulus
{X,X(7)2} & 10

Yosslorgulus
{X,X(8)2} & 10

Brosslorgulus
{X,X(9)2} & 10

Using my own extended SI prefixes because I can :D

Gosslorgulus
{X,X(10)2} & 10

Mosslorgulus
{X,X(20)2} & 10

Hasslorgulus
{X,X(30)2} & 10

Kysslorgulus
{X,X(40)2} & 10
Pisslorgulus
{X,X(50)2} & 10

Sasslorgulus
{X,X(60)2} & 10

Pexxlorgulus
{X,X(70)2} & 10

This number had to be renamed pexxlorgulus from my extended prefix pectra- for
1000^70 from pesslorgulus, so that it would not be confused with {X,X(5)2} & 10.

Nisslorgulus
{X,X(80)2} & 10

Zozzlorgulus
{X,X(90)2} & 10

Golapulus
{X,X(100)2} & 10 = 10^100 & 10 & 10

Yes, we FINALLY MADE IT to a golapulus, the next Bowerian googolism after a

humongulus. Unlike all the previous array notation numbers I made up, this was
actually named by Jonathan Bowers himself.

A golapulus, when comparing it against a humongulus, is SUCH A NEW KIND OF NUMBER.

While a humongulus isn't too problematic to define under any BEAF variant, a
golapulus reaches past the first brick wall you hit when trying to define BEAF and
THEN some!

A humongulus is of order type φ(w,0,0) in the fast-growing hierarchy. But a

golapulus, the VERY NEXT Bowerian number after a humongulus is believed to be of
order type of ψ(ΩΩ^Ω^w) - that skips several important ordinals like gamma-0, the
SVO, and possibly the LVO! There are no Bowerian googolisms of order type of any of
these three ordinals, only a humongulus at a much smaller order type and a
golapulus at a much higher order type!

Why was Jonathan Bowers able to make this jump? Because of the cleverness of the
array of operator. With just the array of operator added to BEAF, we can logically
go from epsilon-zero all the way to either the LVO or θ(Ωw), which represents the
order type of numbers like 10&10&10&10&10.....&10 with 100 10's! That's a huge leap
alright!

However, the array of operator has a HUGE problem: it's VERY informally defined. In
fact, it's so informal that it's hard to decide how exactly to even define numbers
with the operator! I myself am currently trying to figure out how to go further
than the SVO with BEAF, which still doesn't reach the limit of the array of
operator.

In any case, the next Bowerian googolism is a golapulusplex, a golapulus array of

tens (and an exception to Bowers' usual interpretation of -plex). Let's just say
that a golapulusplex is a whole new level of hard to define than a golapulus is!

Ginglapulus
{X,100(0,2)2} & 10

Now back to the main sequence of numbers I made up till I hit a golapulusplex.

Ganglapulus
{X,100(0,3)2} & 10

Note that the array of operator allows us to blast through numbers a lot quickly
than we "should".

Geenglapulus
{X,100(0,4)2} & 10

Bolapulus
{X,100(0,0,1)2} & 10

Trolapulus
{X,100(0,0,0,1)2} & 10

Goplapulus
{X,100((1)1)2} & 10

Goduplapulus
{X,100((0,1)1)2} & 10

Gotriplapulus
{X,100(((1)1)1)2} & 10

fψ(ε(Ω+1))(100)

This number is an entry used to discuss yet another order type in the fast-growing
hierarchy, this time the Bachmann-Howard Ordinal, or BHO for short - the BHO can be
imagined as ψ(ΩΩ^Ω^Ω......). The BHO is significant in many places in mathematics,
and in a few places in googology.

For one thing, the BHO represents a milestone point in functions. But also, the BHO
yet again exemplifies the issue of BEAF. Remember that there are two main beliefs
about BEAF: the idea that {X,X/2} is the LVO, and the idea that it’s ψ(Ωw). That’s
a bigger gulf than you might think - in the second idea BEAF reaches well past the
BHO and probably transcends the theta function entirely and maybe even the psi
function, but in the first BEAF likely doesn’t even make it to the BHO! My current
idea of BEAF is built upon the more powerful idea, and therefore I plan on having
it hit the BHO - however I haven’t reached that yet, and it isn’t easy to do that
with the difficulties of actually trying to define the array of operator.

Also, an early version of Chris Bird’s arrays had the BHO as the growth limit, and
the BHO in the slow-growing hierarchy is equivalent to the important epsilon-zero
in the fast-growing hierarchy, which I discuss in part 5.

Extremexul
200![1(1)[2200,200,200,200]]

This number is another major jump in Hollom’s hyperfactorials. It goes straight to

the higher hyper-nested arrays - I won’t claim to actually know how they work,
though they involve higher-order brackets, specifically things like [2 which are
known as “second-type brackets”. This value is comparable to order-type of the BHO
in the fast-growing hierarchy.

The Higher-Sublegion Range

X^^X&X&a ~ {X,X/2}
(order type ψ(εΩ+1) ~ ψ(Ωw)
Entries: 15

Extremebixul
200![1(1)2200,200,200,200,200]

Now, naturally, we’ll continue adding entries to add onto the arrays’ power. This
number is about fψ(ζ(Ω+1))(200) in the FGH.

Extremetrixul
200![1(1)2200,200,200,200,200,200]

About fψ(η(Ω+1))(200) in the FGH.

Extremequaxul
200![1(1)2200,200,200,200,200,200,200]

About fψ(φ(4,Ω+1))(200) in the FGH.

Hypertriakulus
3&3&3&3 = {3,4/2}

This is a pentational-array-array number I coined simply to show how BEAF isn’t as

much of dichotomy between well-defined and ill-defined as it is a continuum between
the two: this number vs the triakulus shows this kind of thing. While a triakulus
can easily become fully defined if one allows liberty with some guesswork, the same
cannot be said about a hypertriakulus. I am yet to be able to reach that
construction in my variant of BEAF, but once I do I’ll probably be able to go all
the way to the limits of the array of operator.

Tetrakulus
4&4&4&4 = {4,4/2}

This number is an extrapolation from a triakulus which can be expressed as 3&3&3 -

I coined this number to show how (a) unfathomably larger it is than a triakulus and
(b) much more difficult it is to define. It can be thought of as a “supertet array
of 4’s” array of 4’s - since supertet is unfathomably larger than tritri, a
supertet array of 4’s is most definitely unfathomably larger than a tritri array of
3’s, and then a supertet array of 4’s even MORE so.

Golapulusplex
{10,10(100)2}&10&10 = 10^100&10&10&10

Now for a leap up to Bowers' golapulusplex. While a golapulus is a gongulus array

of tens, a golapulusplex is a golapulus array of tens! Note that this is an unusual
interpretation of the -plex suffix, since normally Bowers uses -plex to indicate
simple recursion (e.g. gongulusplex = {10,100(gongulus)2}), but here he does
something entirely different - once again that’s taking advantage of the array-of
operator.

A golapulusplex is a whole new level of “hard to formalize” than a golapulus,

because now we’ve reached dimensional-array-array-arrays (O_o), and those require
whole new ideas on how to work with the separatotrs - for instance how do you
define {X,2X(X^^X)2}&10 vs {X,X(X^^X)2}&10?

This number is about fψ(Ω_2^Ω_2^w)(100) in the fast-growing hierarchy - note that _

indicates subscript just like ^ indicates superscript.

Pentakulus
{5,5/2} = 5&5&5&5&5

This number is 5 5’s with the array-of operator, a ““superpent array of 5’s” array
of 5’s” array of 5’s.

Hexakulus
{6,6/2}

In general, {a,b/2} = a&a&a......&a&a with b a’s.

Heptakulus
{7,7/2}

Oktakulus
{8,8/2}

Ennakulus
{9,9/2}

Big Mac / Dekakulus

{10,10/2}

This is a number I coined as a googolism that seems to be missing from BEAF - one
that direectly welcomes you to the next level of notation like a goobol or gongulus
does. It is equal to 10&10&10&10&10&10&10&10&10&10 with the array-of operator. (yes
I based the name upon the hamburger)
Lower bound for SCG(13)
~ fψ(Ω_w)(13)
This is a "weak" lower bound for SCG(13), a number that appears in serious
mathematics but is EVEN BIGGER than the incredibly monstrous TREE(3).
What exactly is SCG? SCG stands for Subcubic Graph, a function that, like the TREE
function, was devised by Harvey Friedman. It's somewhat similar to TREE but it's
about subcubic graphs instead of k-labeled trees.
SCG(x) is then defined as the length of the longest possible sequence of subcubic
graphs G1, G2, ... Gn such that Gi has at most i+x vertices and none is
homeomorphically embeddable into a later graph.
The function grows INCREDIBLY quickly, zooming past epsilon-zero, gamma-zero, the
SVO, the LVO, and even the BHO. Hell, it's far more powerful than the TREE
function! Here's some information on values of SCG(x):
SCG(0) can be shown to equal 6.
Hyp cos of Googology Wiki proved SCG(1) to be at least of order type epsilon-two in
the fast-growing hierarchy.
He also proved SCG(2) to be at least of order type of the SVO, although in both of
those bounds he uses a nonstandard choice of fundamental sequences for ordinals.
SCG(x) grows at a rate somewhere beyond what would be comparable to fψ(Ω_w)(x) in
terms of the fast-growing hierarchy, making it an incredibly powerful function
that, like TREE(x), is quite simple. SCG(13) was chosen as a large number to use in
particular because Harvey Friedman had a specific sequence in mind.
Incredibly, SCG(13) is STILL not the largest number to appear in professional
mathematics ... there are beaten by something devised by Friedman called finite
promise games, which even beat Loader's number, which is itself one of the largest
numbers known ...
The Whopper
{10,100/2}
This is a number equal to 10&10&10 ... &10 with 100 10's, a name I coined in
analogy to the big mac. Like the big mac, it's both named after a hamburger and
meant as "a transition googolism" between the array-of operator and legion arrays.
fψ(Ω_w)(100)
This is just an entry to discuss the order type of the ordinal ψ(Ωw), an ordinal
with a special significance to googology. It is believed to represent the limit of
the array-of operator, i.e. the limit of things like a&a&a&a .... &a with a a's,
making it a major turning point in large numbers for those who like to use BEAF as
a measuring stick (although many nowadays object to that usage because of BEAF's
major ambiguities). This order-type is commonly used as a lower bound for numbers
that are large by googological standards, numbers that hold a high spot among the
googolisms.
In addition, this ordinal is the first point where the slow-growing hierarchy
catches up with the fast-growing hierarchy, under the most common usage. That means
that ψ(Ωw) is the smallest ordinal α such that fα(n) is in general comparable to
gα(n) (using the slow-growing hierarchy).
This ordinal is also the limit of Chris Bird's Hierarchial Hyper-Nested Arrays, a
subset of his array notation which is currently limited at the ordinal ψ(ΩΩ).

Now at this point, a full list of numbers after this point is yet to be released.
When it is, part 7 of this list will be released. For now here are some notable
numbers larger than the entry above:

The Infinite-Scraping Range

order type ψ(Ωw) ~ ????
Entries: 5

Meameamealokkapoowa oompa
{LLL......LLL,10}10,10 with a meameamealokkapoowa array of L's

The infamous meameamealokkapoowa oompa is Jonathan Bowers' largest and most famous

googolism. It is often again and again hailed as one of the largest numbers in the
world, if not the largest, but it's so ambiguously defined (what does an "array of
L's" actually solve to?!) that it has more recently gotten a kind of infamy among
the googology community. Nobody has come even close to agreement on how it should
be defined and how big it is, and many will refuse to call it a number! This is not
that we hate Jonathan Bowers or his work, it's just that this is a very strange
googolism. I can't help but believe that Bowers had some unique idea of what arrays
of L's really decompose to, but he just didn't describe it on his website and we
might not know for quite a long time. Let me stress once again that I do not hate
Bowers' work - his work is worthy of a lot of merit for its aesthetic appeal and
founding the spirit of modern googology.
Nonetheless, this could very well be among the largest numbers known, but is still
beaten by something like...

100R{0,,, ...(100 commas)... ,,,1} using Hyp cos's R function

There are indeed googological notations that transcend however powerful Bowers'
BEAF is believed to be. These are Wythagoras's dollar function, and Hyp cos's R
function (Wythagoras and Hyp cos are both Googology Wiki users). It is not known
which is more powerful, but since the dollar function is currently fairly unstable
and under improvement I'll use Hyp cos's R function here.

Now the R function is a highly intricate and complicated function, and the pages
which introduce it (Hyp cos's user page introduces that notation) are certainly not
an easy read for beginning googologists. This number in particular is right around
the limit of what the R function currently has. It is a truly cutting-edge
notation, transcending even any known recursive ordinal in the fast-growing
hierarchy, although neither of the functions have ay googolisms defined with
them. What's surprising is that there are computable functions that can create
numbers that are even more (MUCH more) "way out there" so to speak ...

Loader's number
D5(99)

Loader's number, along with TREE(3) and Rayo's number, is one of the most well-
known numbers larger than Graham's number. Before I can explain what exactly it is,
I'll describe how exactly this monstrous number came to be - although I discuss
just that on some other earlier entries, I'll describe how Loader's number came to
be for the sake of this being a standalone entry.

In 2001 there was a competition called Bignum Bakeoff hosted online by David Moews.

The goal was to submit a C program with 512 characters or less. Entries were
submitted through email. A total of twenty entries were submitted (nine from the
same person), fourteen of which produced a large number. The winning program was
titled loader.c and was submitted by Ralph Loader, and the number it outputs it
today known as Loader's number.

As it turns out, Loader's number is not just any large number, but it is
legitimately one of the largest numbers known. It totally crushes even the second-
place program, marxen.c, which uses a variant of Goodstein sequences to get a bit
past order-type epsilon-zero in the fast-growing hierarchy. Loader's program
diagonalizes over the calculus of constructions which can easily generate numbers
much larger than those any known notation can describe!

In Loader's program, the function D(n) is defined as the sum of all possible bit
strings described by the first n expressions in the calculus of constructions.
Then, the output of the program is defined as D(D(D(D(D(99))))), or D5(99) for
short (the exponent denotes how many times the D(n) is applied to 99).

How does Loader's number end up so big? Diagonalizing over systems like the
calculus of constructions is a MUCH more efficient way to generate large numbers
than just inventing an iterative function. The calculus of constructions is in
particular a good choice for a program to output the largest number you can, since
it can be thought of as a programming language where every possible program
terminates! By using the calculus of constructions, the D function has a growth
rate that vastly exceeds any known ordinal in the fast-growing hierarchy!

The D(n) function, despite all this, is still a computable function! Why is that?
Because a computable function is a function that can have a computer program
written to calculate it, and D(n) is defined with a computer program! But why is
that important? Because all computable functions are by necessity beaten by some of
the uncomputable functions, functions that cannot be calculated using a computer
program. The best-known and original uncomputable function is the busy beaver
function, which is discussed at the entries for 107 and 4098. It has the mind-
bending property of being able to create values larger than ANY computable
function, no matter how powerful your function is, even if it's Loader's D
function!!! But there's an additional important note I'd like to make: not all
uncomputable functions are more powerful than all computable functions. For
example, it's possible to use Turing machines to devise an uncomputable function
that can only output 0 or 1, and that's obviously not even anywhere near as
powerful as any googological functions!

In any case, Loader's number is currently honored as the largest named computable
number (a number defined using a computable function). However, Loader's function
is not the most powerful known computable function - Friedman's finite promise
games and finite trees can lead to some EVEN MORE POWERFUL computable functions.
There are a few googolisms that surpass Loader's number...

Rayo's number
Rayo(10100)

Rayo's number is another one of the most famous numbers larger than Graham's
number. In fact, for a while it was honored as the largest named number! Once
again, first I'll explain how it came to be, then what it is.

Rayo's number came from a big number duel held at MIT in January 2007, where Adam
Elga (a Princeton professor) and Agustin Rayo (a MIT professor) took turns coming
up with a larger number than the previous number until one of them couldn't come up
with a larger number. However there were a few constraints. You could not use
semantic vocabulary (e.g. the smallest number larger than any number a human has
named). You also could not invoke infinity. In addition there's a "gentleman's
agreement" that your number should be something that cannot be made with tools your
opponent introduced - for example if your opponent devises a fast-growing function
F(n) and defines F(100), you can't respond with something like F(F(100)).

The duel began with Elga writing 1 on the board. Then Rayo responded by writing a
long string of ones. Elga then retaliated by replacing half of the ones with
factorials. Then they began to invent their own notations as the audience watched
and asked questions about their functions. In the end Rayo wrote on the board:

"The smallest number bigger than any finite number named by an expression in the
language of first-order set theory with a googol symbols or less."

and since Elga could not come up with a significantly larger number, Rayo won the
competition. The number can in fact be generalized to a function, where "the
smallest number bigger than any finite number named by an expression in the
language of set theory with x symbols or less" is denoted Rayo(x), also sometimes
denoted FOST(x) from FOST which stands for first-order set theory.

Now, Rayo's number itself uses a philosopher's trick (Rayo himself is not only
involved in mathematics but also in linguistics and philosophy) - by using first-
order set theory, we can easily diagonalize over any other numbers that were known
at the time. It's far more powerful than the busy beaver function or even Adam
Goucher's xi function! In fact it's very hard to come up with a significantly
larger number. 

From 2007 up to late 2014 Rayo's number was honored as the largest named number.
However this is not strictly true, as people have made extensions upon it like
"Rayoplex" meaning 10 to the power of Rayo's number, or Rayo(1010^100). But those
are not honored as numbers that trounce Rayo, because they are simply naive
extensions. They follow easily from what Rayo defined, and thus do not bring
anything new into the large number discussion! A more clever attempt was Kyodaisuu
of Googology Wiki's Fish number 7, which was defined in October 2013 extends upon
the set theory itself, by adding a new predicate to first-order set theory (FOST
for short). However, as it turns out Fish number 7 does not really improve the
strength of FOST very much. Nonetheless, as Nathan Ho (the founder of Googology
Wiki) once said, Fish number 7 is a step in the right direction from Rayo's number.

Eventually Rayo's number was indeed trounced in a way that would most definitely be
considered a good extension, with a new record-holder number:

BIG FOOT
FOOT10(10100)

BIG FOOT is currently honored as the largest named number. It was defined by
LittlePeng9 of Googology Wiki using something called first-order oodle theory (FOOT
for short), a generalization and extension of first-order set theory. The name was
suggested by Sbiis Saibian. It was developed in a Googology Wiki blog post, and
then Nathan Ho decided to publish it on an article in his own personal website,
with a few additions (mainly on the background of Rayo's number and extensions to
the number).

First order oodle theory is like the set theory used to define Rayo's number, but
augmented with the symbols [ and ]. With just those two symbols we can generate
numbers vastly larger than any other extension to FOST people have yet devised (and
all those other extensions are quite naive). With FOOT, we can define a function
FOOT(x) as the largest number expressible with x symbols in FOOT, and with the FOOT
function LittlePeng9 defined the monstrous number FOOT10(10100) (the superscript 10
denotes how many times FOOT(x) is applied to 10100).

Why is BIG FOOT honored as the largest named number while other extensions like
Fish number 7 weren't? Because it was not a naive extension like the other
extensions to Rayo's number (arguably this includes Fish number 7). Naive
extensions are the best way to embarrass yourself in front of googologists,
because anyone could come up with them, while the same cannot be said for coming up
with numbers like Rayo's number, BIG FOOT, or even just Graham's number.

And that brings us to an important point: googology is not so much about finding
the largest number as it is about continually finding better ways to make large
numbers. As Nathan Ho once said, "googology is a never-ending quest to outrun
itself".

So what is the largest finite number? There isn't one! But this fact does not mean
that it's pointless to come up with the largest number you can. The ultimate point
of googology is to come up with continually larger numbers! There is no limit to
how large numbers can be, but there is a limit to how large numbers humans have
thought up at any point in time (things like Sam's Number, a "number" described as
so huge that it's impossible to describe, don't count!). There is also a number
honored as the "largest named number", and that is currently BIG FOOT as it is a
number that broke the record of Rayo's number while honoring the gentlemen's
agreement of googology: you don't get bragging rights for coming up with naive
extensions.

So we have reached the current ceiling of human large number knowledge, but we will
never reach the end of numbers, as there are infinitely many numbers between BIG
FOOT or any number out there larger than it and infinity.
If you really want to skip to infinity, you can go to my list of infinite numbers.

Planned for the future: PGLN7 (The Elder Gods), with the numbers in the "infinity-
scraping range" and many more! I don't know when it'll be released though.