Graham’s Number Explained: How Big Is It Really?
Quick answer: Graham’s number is an enormous number that arose as an upper bound in a 1971 Ramsey theory problem by Ronald Graham and Bruce Rothschild. It is built in 64 steps with Knuth’s up-arrow notation: g₁ = 3↑↑↑↑3, and each next step uses g₍ₙ₎ arrows, up to g₆₄. It is far too large to write down, even with one digit per atom in the observable universe, yet its last digits are known: …2464195387.
Graham’s number became famous as “the largest number ever used in a serious mathematical proof.” That is no longer true, but it remains a perfect way to see how quickly numbers can explode. To understand it, we need a new kind of notation.
Up-Arrow Notation
Donald Knuth’s up-arrows build ever faster operations, each repeating the one before:
| Notation | Meaning | Example |
|---|---|---|
| \(3 \uparrow 3\) | Exponent: \(3^3\) | 27 |
| \(3 \uparrow\uparrow 3\) | Power tower: \(3^{3^3}\) | \(3^{27} = 7{,}625{,}597{,}484{,}987\) |
| \(3 \uparrow\uparrow\uparrow 3\) | \(3 \uparrow\uparrow (3 \uparrow\uparrow 3)\) | A tower of 3s about 7.6 trillion high |
| \(3 \uparrow\uparrow\uparrow\uparrow 3\) | \(3 \uparrow\uparrow\uparrow (3 \uparrow\uparrow\uparrow 3)\) | Already unimaginable |
Review exponent rules to see how fast even single towers grow.
Building Graham’s Number in 64 Steps
\[ g_1 = 3 \uparrow\uparrow\uparrow\uparrow 3, \qquad g_{n+1} = 3 \underbrace{\uparrow\uparrow \cdots \uparrow}_{g_n \text{ arrows}} 3, \qquad G = g_{64}. \]
So \(g_2\) uses \(g_1\) arrows, \(g_3\) uses \(g_2\) arrows, and so on, 64 times. If you tried to write Graham’s number with one digit on every atom in the observable universe (about \(10^{80}\) atoms), you would not get anywhere close; you could not even write the number of its digits, or the number of digits of that.
Where It Came From
It comes from Ramsey theory. Take an \(n\)-dimensional cube and draw a segment between every pair of its \(2^n\) corners (not only the cube’s edges). Color each segment red or blue. Call \(N^*\) the smallest \(n\) such that every coloring has four corners lying in one plane with all six segments between them the same color. In 1971, Graham and Rothschild proved such an \(n\) exists and gave a huge upper bound. The number now called Graham’s number is a simpler (and larger) bound Graham explained to Martin Gardner, who made it famous in 1977.
| Bound on the answer \(n\) | Value |
|---|---|
| Lower bound | 13 (Jerome Barkley, 2008; earlier 11 by Geoffrey Exoo, 2003) |
| Upper bound (Gardner’s version) | Graham’s number |
| Improved upper bound (2014) | Below \(2 \uparrow\uparrow\uparrow 6\) (Mikhail Lavrov, Mitchell Lee and John Mackey), far smaller than Graham’s number |
| Best upper bound (2019, revised 2020) | Below \(2 \uparrow\uparrow\uparrow 5\) (Eryk Lipka) |
So today \(13 \le N^* < 2 \uparrow\uparrow\uparrow 5\). The true answer could be as small as 13, a gap that is itself a famous joke. Note that these improvements shrink the bound on \(N^*\); Graham’s number \(G\) itself is a fixed integer and never changes.
We Know Its Last Digits
Even though we cannot write Graham’s number, its final digits can be computed. Graham’s number is a power tower of 3s, and in a tall enough tower of 3s the last \(d\) digits stop changing as the tower grows (they depend only on remainders modulo \(10^d\)). Its last 10 digits are
\[ \ldots 2464195387. \]
Bigger Numbers
Graham’s number is tiny compared with TREE(3) and the busy beaver values for modest inputs, which also arise in real mathematics.
Common Misconceptions
“Graham’s number is the answer to Graham’s problem.” No. It is an upper bound; the true answer is at least 13 and probably much smaller than the bound.
“Graham’s number is infinite.” No. It is a specific finite whole number, just unimaginably large.
Watch: Graham’s Number in Video
If you learn better by watching, these videos are worth your time.
Check Your Understanding
Five quick questions to see how much of this has stuck. Pick an answer and press Submit; you will see a short explanation either way.
Answer each question and press Submit to see your result right away.
Frequently Asked Questions
What is Graham’s number?
An enormous finite number, built with Knuth’s up-arrow notation in 64 steps, that arose as an upper bound in a Ramsey theory problem by Ronald Graham.
How big is Graham’s number?
So large that writing it with one digit per atom of the observable universe is impossible; even the number of its digits is far too large to write that way.
What problem did Graham’s number come from?
Coloring the lines between corners of a high-dimensional cube red or blue and asking when a single-colored planar set of four corners must appear.
Is Graham’s number the largest number?
No. There is no largest number, and numbers like TREE(3) that arise in mathematics are vastly larger.
Keep Exploring
- TREE(3) Explained: Why It’s Bigger Than Graham’s Number
- Ramsey Numbers Explained: The Party Problem and R(5,5)
- Busy Beaver Explained: BB(5) Solved, BB(6) Still Open
Sources and Further Reading
Related to This Article
More math articles
- North Carolina EOG Grade 6 Math Free Worksheets: Printable EOG-Ready Practice, Answers Included
- Relationships, Marriage, and Family
- From Tables and Graphs to Equations: How to Master Proportional Relationships
- Order of Operations (Introduction) for 4th Grade
- Bayes’ Theorem Explained: Formula + Medical Test Example
- The Ultimate Calculus Course
- Word Replacement and Tone
- The Ultimate Precalculus Course (+FREE Worksheets & Tests)
- Sequence and Chronology
- hCG Calculator (Doubling Time)


What people say about "Graham’s Number Explained: How Big Is It Really? - Effortless Math"?
No one replied yet.