Tetration Calculator
Our free exponents & logarithms calculator solves tetration problems. Get worked examples, visual aids, and downloadable results.
Reviewed for accuracy by Manoj Kumar, Mathematics Educator
Tetration Calculator
Calculator
Adjust values & calculateEnter your values below. Every result is computed in your browser — no data is sent to any server.
Formula: a^^n = a^(a^(a^(...))) with n copies of a
Worked example — 2^^4 = 65,536 (a 5-digit number)
Formula
a^^n = a^(a^(a^(...))) with n copies of a
Tetration is iterated exponentiation. The notation a^^n means a power tower of n copies of the base a, evaluated from the top down (right to left). It is the fourth hyperoperation after addition, multiplication, and exponentiation.
Worked Examples
Example 1: Computing 2^^4 (Tower of 2s)
Problem:Calculate the tetration 2^^4, which is a power tower of four 2s.
Solution:2^^4 = 2^(2^(2^2)) Step 1 (top): Start with 2 Step 2: 2^2 = 4 Step 3: 2^4 = 16 Step 4: 2^16 = 65,536 The tower is evaluated right-to-left (top-down). Note: bottom-up would incorrectly give ((2^2)^2)^2 = 256
Result:2^^4 = 65,536 (a 5-digit number)
Example 2: Computing 3^^3
Problem:Calculate 3^^3, a power tower of three 3s.
Solution:3^^3 = 3^(3^3) Step 1 (top): Start with 3 Step 2: 3^3 = 27 Step 3: 3^27 = 7,625,597,484,987 This 13-digit number shows how quickly tetration grows. 3^^4 = 3^(7,625,597,484,987) which has over 3.6 trillion digits.
Result:3^^3 = 7,625,597,484,987 (a 13-digit number)
Frequently Asked Questions
What is tetration and how does it work?
Tetration is the next hyperoperation after exponentiation in the sequence: addition, multiplication, exponentiation, tetration. Written as a^^n (or using Knuth's up-arrow notation as a^^^^n with two arrows), tetration means building a power tower of a's that is n levels high. For example, 2^^4 means 2^(2^(2^2)) = 2^(2^4) = 2^16 = 65,536. The computation proceeds from the top of the tower downward (right to left). Tetration produces astronomically large numbers even for small inputs. The number 3^^3 equals 3^(3^3) = 3^27 = 7,625,597,484,987, and 3^^4 is so large it has over 3.6 trillion digits.
Why does tetration grow so incredibly fast?
Tetration grows faster than any exponential function because each level of the power tower exponentially amplifies the result of the level above it. While exponentiation (a^n) grows faster than polynomial functions, tetration (a^^n) grows incomparably faster than exponentiation. Consider: 10^10 = 10 billion, but 10^^2 = 10^10 = 10 billion (same), 10^^3 = 10^(10 billion) which is a number with 10 billion digits, and 10^^4 is 10 raised to that enormous power. Each additional level in the tower does not just add or multiply the result; it uses the previous astronomical result as the exponent. This cascading amplification makes tetration impractical to compute for all but the smallest inputs.
What is Knuth's up-arrow notation?
Knuth's up-arrow notation is a compact way to express hyperoperations. A single arrow a^b represents exponentiation. Two arrows a^^b (or a up-up b) represent tetration. Three arrows represent pentation (iterated tetration), and so on. The notation was introduced by Donald Knuth in 1976. In this system, a^n = a multiplied by itself n times, a^^n means a tower of a's n high, a^^^n means a tetrated by itself n times. This notation extends to any number of arrows and is used in combinatorics and theoretical computer science to express incomprehensibly large numbers. Graham's number, one of the largest numbers used in a mathematical proof, requires 64 layers of Knuth's arrows to express.
What are the conventions for tetration with special values?
There are several important conventions for special cases. By convention, a^^0 = 1 for all a (consistent with the idea that an empty power tower equals 1, the multiplicative identity). Also, a^^1 = a (a tower of height 1 is just the base). For a = 1, 1^^n = 1 for all n because any tower of 1s equals 1. For a = 0, the situation is more nuanced: 0^^1 = 0, 0^^2 = 0^0 which is often defined as 1, and 0^^3 = 0^1 = 0, alternating between 0 and 1. These edge cases illustrate why extending tetration to non-integer heights and arbitrary bases requires careful mathematical treatment.
Can tetration be extended to non-integer heights?
Extending tetration to real or complex heights is an active area of mathematical research. Unlike exponentiation where fractional powers are well-defined (e.g., 4^(1/2) = 2), there is no universally accepted definition for fractional tetration like 2^^(1/2). Several approaches have been proposed, including using the natural iteration of the logarithm (Kneser's approach), functional equations, and Abel functions. Each method has different properties and limitations. The challenge is finding a smooth interpolation between integer values that preserves desirable mathematical properties like monotonicity and analyticity. This remains one of the unsolved problems in iterated function theory.
How is tetration related to the Ackermann function?
The Ackermann function is a recursive function that grows even faster than primitive recursive functions, and tetration appears as one of its stages. Specifically, the Ackermann function A(m,n) produces results related to hyperoperations: A(1,n) relates to addition, A(2,n) to multiplication, A(3,n) to exponentiation, and A(4,n) to tetration. The Ackermann function was one of the first examples of a computable function that is not primitive recursive, demonstrating that there exist well-defined functions that grow faster than any nested loop program. Understanding tetration helps bridge the gap between elementary arithmetic and the theory of computability.
What is the largest number that can be expressed using tetration?
There is no largest number expressible by tetration because you can always increase the height of the tower. However, specific well-known large numbers involve tetration. Graham's number, used in Ramsey theory, is defined using iterated Knuth arrow operations far beyond tetration. The number TREE(3) from graph theory dwarfs Graham's number. In practical terms, even 3^^4 (which equals 3^(3^(3^3)) = 3^(7,625,597,484,987)) has more than 3.6 trillion digits and far exceeds the number of particles in the observable universe (approximately 10^80). The number 10^^5 is so large that we lack any physical analogy to comprehend its magnitude.
How do you compute tetration step by step?
Tetration is computed from the top of the power tower downward, not from the bottom up. For 2^^4, start at the top: begin with the topmost 2, then compute 2^2 = 4, then 2^4 = 16, then 2^16 = 65,536. The order matters enormously. If you computed bottom-up (left to right), 2^^4 would give ((2^2)^2)^2 = 4^2^2 = 256, which is wrong. The correct right-to-left evaluation gives 65,536. For each step, the previous result becomes the exponent of the base. This means even one additional level in the tower can transform a manageable number into an astronomically large one, making manual computation infeasible for towers of height 5 or more with base 2 or larger.
What are super-roots and super-logarithms?
Just as logarithms and roots are inverse operations of exponentiation, super-roots and super-logarithms are inverse operations of tetration. The super-root asks: given a^^n = x, what is a? The super-logarithm (or iterated logarithm) asks: given a^^n = x, what is n? The iterated logarithm log*(x) counts how many times you must take the logarithm before the result drops below 1. For example, log*(65536) = 4 because log2(log2(log2(log2(65536)))) = log2(log2(log2(16))) = log2(log2(4)) = log2(2) = 1. The iterated logarithm grows incredibly slowly and appears in theoretical computer science to describe the complexity of certain algorithms.
Where does tetration appear in mathematics and computer science?
Tetration appears in several mathematical and computational contexts. In number theory, it relates to the study of large numbers and fast-growing hierarchies. In combinatorics, problems involving recursive structures sometimes require tetration-level growth rates. In computer science, the iterated logarithm (inverse of tetration) appears in the analysis of algorithms like union-find with path compression, which has nearly-constant amortized time complexity. In proof theory, the fast-growing hierarchy classifies functions by growth rate, with tetration appearing at the third level. Tetration also appears in recreational mathematics and in defining the levels of the busy beaver function, which measures the maximum productivity of Turing machines.
References
Reviewed for accuracy by Manoj Kumar, Mathematics Educator · Editorial policy
Related Calculators
🧮Annulus Area Calculator
Calculate annulus area with inputs, formulas, and instant results.
🧮Area Calculator
Calculate area with inputs, formulas, and instant results.
🧮Area of a Rectangle Calculator
Calculate the area, perimeter, and diagonal of a rectangle. Find missing sides from known area. Convert between metric and imperial area units.
🧮Area of Crescent Calculator
Calculate area of crescent with inputs, formulas, and instant results.
🧮Center of Mass Calculator
Calculate center of mass with inputs, formulas, and instant results.
🧮Centroid Calculator
Calculate centroid with inputs, formulas, and instant results.
🧮Chord Length Calculator
Calculate chord length with inputs, formulas, and instant results.
🧮Conic Sections Calculator
Calculate conic sections with inputs, formulas, and instant results.