Large numbers are numbers far larger than those encountered in everyday life, such as simple counting or financial transactions. These quantities appear prominently in mathematics , cosmology , cryptography , and statistical mechanics . Googology studies the naming conventions and properties of these immense numbers. [ 1 ] [ 2 ] Since the customary decimal format of large numbers can be lengthy, other systems have been devised that allows for shorter representation. For example, a billion is represented as 10 characters (1,000,000,000) in decimal format, but is only 3 characters (10 9 ) when expressed in exponential format . A trillion is 13 characters in decimal, but only four (10 12 ) in scientific notation . Values that vary dramatically can be represented and compared graphically via a logarithmic scale . Natural language numbering A natural language numbering system represents large numbers using names rather than a series of digits. For example " billion " may be easier to comprehend for some readers than "1,000,000,000". Sometimes it is shortened by using a suffix, for example 2,340,000,000 = 2.34B (B = billion). A numeric value can be lengthy when expressed in words, for example, "2,345,789" is "two million, three hundred forty five thousand, seven hundred and eighty nine". [ 3 ] Scientific notation Scientific notation was devised to represent the vast range of values encountered in scientific research in a format that is more compact than traditional formats yet allows for high precision when called for. [ 4 ] A value is represented as a decimal fraction times a multiple power of 10 . [ 4 ] The factor is intended to make reading comprehension easier than a lengthy series of zeros. For example, 1.0 × 10 9 expresses one billion – 1 followed by nine zeros. The reciprocal , one billionth, is 1.0 × 10 −9 . Sometimes the letter e replaces the exponent, for example 1 billion may be expressed as 1e9 instead of 1.0 × 10 9 . googol = 10 100 {\displaystyle 10^{100}} centillion = 10 303 {\displaystyle 10^{303}} or 10 600 {\displaystyle 10^{600}} , depending on the number naming system millinillion = 10 3003 {\displaystyle 10^{3003}} or 10 6000 {\displaystyle 10^{6000}} , depending on the number naming system The largest known Smith number = (10 1031 −1) × (10 4594 + 3 × 10 2297 + 1) 1476 × 10 3 913 210 The largest known Mersenne prime = 2 136 , 279 , 841 − 1 {\displaystyle 2^{136,279,841}-1} [ 5 ] googolplex = 10 googol = 10 10 100 {\displaystyle 10^{\text{googol}}=10^{10^{100}}} Skewes's numbers : the first is approximately 10 10 10 34 {\displaystyle 10^{10^{10^{34}}}} , the second 10 10 10 964 {\displaystyle 10^{10^{10^{964}}}} Graham's number , larger than what can be represented even using power towers ( tetration ). However, it can be represented using layers of Knuth's up-arrow notation . Kruskal's tree theorem is a sequence relating to graphs. TREE(3) is larger than Graham's number . Rayo's number is a large number named after Agustín Rayo which has been claimed to be the largest named number. It was originally defined in a "big number duel" at MIT on 26 January 2007. Examples of large numbers describing real-world things: The number of cells in the human body (estimated at 3.72 × 10 13 ), or 37.2 trillion [ 6 ] The number of bits on a computer hard disk ( as of 2024 [ update ] , typically about 10 13 , 1–2 TB ), or 10 trillion The number of neuronal connections in the human brain (estimated at 10 14 ), or 100 trillion The Avogadro constant is the number of "elementary entities" (usually atoms or molecules) in one mole ; the number of atoms in 12 grams of carbon-12 – approximately 6.022 × 10 23 , or 602.2 sextillion. The total number of DNA base pairs within the entire biomass on Earth, as a possible approximation of global biodiversity , is estimated at (5.3 ± 3.6) × 10 37 , or 53±36 undecillion [ 7 ] [ 8 ] The Earth consists of about 4 × 10 51 , or 4 sexdecillion, nucleons The estimated number of atoms in the observable universe (10 80 ), or 100 quinvigintillion The lower bound on the game-tree complexity of chess , also known as the " Shannon number " (estimated at 10 120 ), or 1 novemtrigintillion. [ 9 ] Note that this value of the Shannon number is for Standard Chess. It has even larger values for larger-board chess variants such as Grant Acedrex , Tai Shogi , and Taikyoku Shogi . In astronomy and cosmology large numbers for measures of length and time are encountered. For instance, according to the prevailing Big Bang model , the universe is approximately 13.8 billion years old (equivalent to 4.355 × 10 17 seconds). The observable universe spans 93 billion light years (approximately 8.8 × 10 26 meters) and hosts around 5 × 10 22 stars, organized into roughly 125 billion galaxies (as observed by the Hubble Space Telescope). As a rough estimate, there are about 10 80 atoms within the observable universe. [ 10 ] According to Don Page , physicist at the University of Alberta, Canada, the longest finite time that has so far been explicitly calculated by any physicist is [ 11 ] (which corresponds to the scale of an estimated Poincaré recurrence time for the quantum state of a hypothetical box containing a black hole with the estimated mass of the entire universe, observable or not, assuming a certain inflationary model with an inflaton whose mass is 10 −6 Planck masses ), roughly 10^10^1.288*10^3.884 T [ 12 ] [ 13 ] This time assumes a statistical model subject to Poincaré recurrence. A much simplified way of thinking about this time is in a model where the universe's history repeats itself arbitrarily many times due to properties of statistical mechanics ; this is the time scale when it will first be somewhat similar (for a reasonable choice of "similar") to its current state again. Combinatorial processes give rise to astonishingly large numbers. The factorial function, which quantifies permutations of a fixed set of objects, grows superexponentially as the number of objects increases. Stirling's formula provides a precise asymptotic expression for this rapid growth. [ 14 ] In statistical mechanics, combinatorial numbers reach such immense magnitudes that they are often expressed using logarithms . Gödel numbers , along with similar representations of bit-strings in algorithmic information theory , are vast—even for mathematical statements of moderate length. Remarkably, certain pathological numbers surpass even the Gödel numbers associated with typical mathematical propositions. [ 15 ] Logician Harvey Friedman has made significant contributions to the study of very large numbers, including work related to Kruskal's tree theorem and the Robertson–Seymour theorem . [ 16 ] "Millions and billions" To help viewers of Cosmos distinguish between "millions" and "billions", astronomer Carl Sagan stressed the "b". Sagan never did, however, say " billions and billions ". The public's association of the phrase and Sagan came from a Tonight Show skit. Parodying Sagan's effect, Johnny Carson quipped "billions and billions". [ 17 ] The phrase has, however, now become a humorous fictitious number—the Sagan . Cf. , Sagan Unit . Standardized system of writing A standardized way of writing very large numbers allows them to be easily sorted in increasing order, and one can get a good idea of how much larger a number is than another one. To compare numbers in scientific notation, say 5×10 4 and 2×10 5 , compare the exponents first, in this case 5 > 4, so 2×10 5 > 5×10 4 . If the exponents are equal, the mantissa (or coefficient) should be compared, thus 5×10 4 > 2×10 4 because 5 > 2. Tetration with base 10 gives the sequence 10 ↑ ↑ n = 10 → n → 2 = ( 10 ↑ ) n 1 {\displaystyle 10\uparrow \uparrow n=10\to n\to 2=(10\uparrow )^{n}1} , the power towers of numbers 10, where ( 10 ↑ ) n {\displaystyle (10\uparrow )^{n}} denotes a functional power of the function f ( n ) = 10 n {\displaystyle f(n)=10^{n}} (the function also expressed by the suffix "-plex" as in googolplex, see the googol family ). These are very round numbers, each representing an order of magnitude in a generalized sense. A crude way of specifying how large a number is, is specifying between which two numbers in this sequence it is. More precisely, numbers in between can be expressed in the form ( 10 ↑ ) n a {\displaystyle (10\uparrow )^{n}a} , i.e., with a power tower of 10s, and a number at the top, possibly in scientific notation, e.g. 10 10 10 10 10 4.829 = ( 10 ↑ ) 5 4.829 {\displaystyle 10^{10^{10^{10^{10^{4.829}}}}}=(10\uparrow )^{5}4.829} , a number between 10 ↑ ↑ 5 {\displaystyle 10\uparrow \uparrow 5} and 10 ↑ ↑ 6 {\displaystyle 10\uparrow \uparrow 6} (note that 10 ↑ ↑ n < ( 10 ↑ ) n a < 10 ↑ ↑ ( n + 1 ) {\displaystyle 10\uparrow \uparrow n<(10\uparrow )^{n}a<10\uparrow \uparrow (n+1)} if 1 < a < 10 {\displaystyle 1<a<10} ). (See also extension of tetration to real heights .) Thus googolplex is 10 10 100 = ( 10 ↑ ) 2 100 = ( 10 ↑ ) 3 2 {\displaystyle 10^{10^{100}}=(10\uparrow )^{2}100=(10\uparrow )^{3}2} . Another example: Thus the "order of magnitude" of a number (on a larger scale than usually meant), can be characterized by the number of times ( n ) one has to take the l o g 10 {\displaystyle log_{10}} to get a number between 1 and 10. Thus, the number is between 10 ↑ ↑ n {\displaystyle 10\uparrow \uparrow n} and 10 ↑ ↑ ( n + 1 ) {\displaystyle 10\uparrow \uparrow (n+1)} . As explained, a more precise description of a number also specifies the value of this number between 1 and 10, or the previous number (taking the logarithm one time less) between 10 and 10 10 , or the next, between 0 and 1. I.e., if a number x is too large for a representation ( 10 ↑ ) n x {\displaystyle (10\uparrow )^{n}x} the power tower can be made one higher, replacing x by log 10 x , or find x from the lower-tower representation of the log 10 of the whole number. If the power tower would contain one or more numbers different from 10, the two approaches would lead to different results, corresponding to the fact that extending the power tower with a 10 at the bottom is then not the same as extending it with a 10 at the top (but, of course, similar remarks apply if the whole power tower consists of copies of the same number, different from 10). If the height of the tower is large, the various representations for large numbers can be applied to the height itself. If the height is given only approximately, giving a value at the top does not make sense, so the double-arrow notation (e.g. 10 ↑ ↑ ( 7.21 × 10 8 ) {\displaystyle 10\uparrow \uparrow (7.21\times 10^{8})} ) can be used. If the value after the double arrow is a very large number itself, the above can recursively be applied to that value. Similarly to the above, if the exponent of ( 10 ↑ ) {\displaystyle (10\uparrow )} is not exactly given then giving a value at the right does not make sense, and instead of using the power notation of ( 10 ↑ ) {\displaystyle (10\uparrow )} , it is possible to add 1 {\displaystyle 1} to the exponent of ( 10 ↑ ↑ ) {\displaystyle (10\uparrow \uparrow )} , to obtain e.g. ( 10 ↑ ↑ ) 3 ( 2.8 × 10 12 ) {\displaystyle (10\uparrow \uparrow )^{3}(2.8\times 10^{12})} . If the exponent of ( 10 ↑ ↑ ) {\displaystyle (10\uparrow \uparrow )} is large, the various representations for large numbers can be applied to this exponent itself. If this exponent is not exactly given then, again, giving a value at the right does not make sense, and instead of using the power notation of ( 10 ↑ ↑ ) {\displaystyle (10\uparrow \uparrow )} it is possible use the triple arrow operator, e.g. 10 ↑ ↑ ↑ ( 7.3 × 10 6 ) {\displaystyle 10\uparrow \uparrow \uparrow (7.3\times 10^{6})} . If the right-hand argument of the triple arrow operator is large the above applies to it, obtaining e.g. 10 ↑ ↑ ↑ ( 10 ↑ ↑ ) 2 ( 10 ↑ ) 497 ( 9.73 × 10 32 ) {\displaystyle 10\uparrow \uparrow \uparrow (10\uparrow \uparrow )^{2}(10\uparrow )^{497}(9.73\times 10^{32})} (between 10 ↑ ↑ ↑ 10 ↑ ↑ ↑ 4 {\displaystyle 10\uparrow \uparrow \uparrow 10\uparrow \uparrow \uparrow 4} and 10 ↑ ↑ ↑ 10 ↑ ↑ ↑ 5 {\displaystyle 10\uparrow \uparrow \uparrow 10\uparrow \uparrow \uparrow 5} ). This can be done recursively, so it is possible to have a power of the triple arrow operator. Then it is possible to proceed with operators with higher numbers of arrows, written ↑ n {\displaystyle \uparrow ^{n}} . Compare this notation with the hyper operator and the Conway chained arrow notation : An advantage of the first is that when considered as function of b , there is a natural notation for powers of this function (just like when writing out the n arrows): ( a ↑ n ) k b {\displaystyle (a\uparrow ^{n})^{k}b} . For example: and only in special cases the long nested chain notation is reduced; for ″ b ″ = 1 {\displaystyle ''b''=1} obtains: Since the b can also be very large, in general it can be written instead a number with a sequence of powers ( 10 ↑ n ) k n {\displaystyle (10\uparrow ^{n})^{k_{n}}} with decreasing values of n (with exactly given integer exponents k n {\displaystyle {k_{n}}} ) with at the end a number in ordinary scientific notation. Whenever a k n {\displaystyle {k_{n}}} is too large to be given exactly, the value of k n + 1 {\displaystyle {k_{n+1}}} is increased by 1 and everything to the right of ( n + 1 ) k n + 1 {\displaystyle ({n+1})^{k_{n+1}}} is rewritten. For describing numbers approximately, deviations from the decreasing order of values of n are not needed. For example, 10 ↑ ( 10 ↑ ↑ ) 5 a = ( 10 ↑ ↑ ) 6 a {\displaystyle 10\uparrow (10\uparrow \uparrow )^{5}a=(10\uparrow \uparrow )^{6}a} , and 10 ↑ ( 10 ↑ ↑ ↑ 3 ) = 10 ↑ ↑ ( 10 ↑ ↑ 10 + 1 ) ≈ 10 ↑ ↑ ↑ 3 {\displaystyle 10\uparrow (10\uparrow \uparrow \uparrow 3)=10\uparrow \uparrow (10\uparrow \uparrow 10+1)\approx 10\uparrow \uparrow \uparrow 3} . Thus is obtained the somewhat counterintuitive result that a number x can be so large that, in a way, x and 10 x are "almost equal" (for arithmetic of large numbers see also below). If the superscript of the upward arrow is large, the various representations for large numbers can be applied to this superscript itself. If this superscript is not exactly given then there is no point in raising the operator to a particular power or to adjust the value on which it act, instead it is possible to simply use a standard value at the right, say 10, and the expression reduces to 10 ↑ n 10 = ( 10 → 10 → n ) {\displaystyle 10\uparrow ^{n}10=(10\to 10\to n)} with an approximate n . For such numbers the advantage of using the upward arrow notation no longer applies, so the chain notation can be used instead. The above can be applied recursively for this n , so the notation ↑ n {\displaystyle \uparrow ^{n}} is obtained in the superscript of the first arrow, etc., or a nested chain notation, e.g.: If the number of levels gets too large to be convenient, a notation is used where this number of levels is written down as a number (like using the superscript of the arrow instead of writing many arrows). Introducing a function f ( n ) = 10 ↑ n 10 {\displaystyle f(n)=10\uparrow ^{n}10} = (10 → 10 → n ), these levels become functional powers of f , allowing us to write a number in the form f m ( n ) {\displaystyle f^{m}(n)} where m is given exactly and n is an integer which may or may not be given exactly (for example: f 2 ( 3 × 10 5 ) {\displaystyle f^{2}(3\times 10^{5})} ). If n is large, any of the above can be used for expressing it. The "roundest" of these numbers are those of the form f m (1) = (10→10→ m →2). For example, ( 10 → 10 → 3 → 2 ) = 10 ↑ 10 ↑ 10 10 10 10 {\displaystyle (10\to 10\to 3\to 2)=10\uparrow ^{10\uparrow ^{10^{10}}10}10} Compare the definition of Graham's number: it uses numbers 3 instead of 10 and has 64 arrow levels and the number 4 at the top; thus G < 3 → 3 → 65 → 2 < ( 10 → 10 → 65 → 2 ) = f 65 ( 1 ) {\displaystyle G<3\rightarrow 3\rightarrow 65\rightarrow 2<(10\to 10\to 65\to 2)=f^{65}(1)} , but also G < f 64 ( 4 ) < f 65 ( 1 ) {\displaystyle G<f^{64}(4)<f^{65}(1)} . If m in f m ( n ) {\displaystyle f^{m}(n)} is too large to give exactly, it is possible to use a fixed n , e.g. n = 1, and apply the above recursively to m , i.e., the number of levels of upward arrows is itself represented in the superscripted upward-arrow notation, etc. Using the functional power notation of f this gives multiple levels of f . Introducing a function g ( n ) = f n ( 1 ) {\displaystyle g(n)=f^{n}(1)} these levels become functional powers of g , allowing us to write a number in the form g m ( n ) {\displaystyle g^{m}(n)} where m is given exactly and n is an integer which may or may not be given exactly. For example, if (10→10→ m →3) = g m (1). If n is large any of the above can be used for expressing it. Similarly a function h , etc. can be introduced. If many such functions are required, they can be numbered instead of using a new letter every time, e.g. as a subscript, such that there are numbers of the form f k m ( n ) {\displaystyle f_{k}^{m}(n)} where k and m are given exactly and n is an integer which may or may not be given exactly. Using k =1 for the f above, k =2 for g , etc., obtains (10→10→ n → k ) = f k ( n ) = f k − 1 n ( 1 ) {\displaystyle f_{k}(n)=f_{k-1}^{n}(1)} . If n is large any of the above can be used to express it. Thus is obtained a nesting of forms f k m k {\displaystyle {f_{k}}^{m_{k}}} where going inward the k decreases, and with as inner argument a sequence of powers ( 10 ↑ n ) p n {\displaystyle (10\uparrow ^{n})^{p_{n}}} with decreasing values of n (where all these numbers are exactly given integers) with at the end a number in ordinary scientific notation. When k is too large to be given exactly, the number concerned can be expressed as f n ( 10 ) {\displaystyle {f_{n}}(10)} =(10→10→10→ n ) with an approximate n . Note that the process of going from the sequence 10 n {\displaystyle 10^{n}} =(10→ n ) to the sequence 10 ↑ n 10 {\displaystyle 10\uparrow ^{n}10} =(10→10→ n ) is very similar to going from the latter to the sequence f n ( 10 ) {\displaystyle {f_{n}}(10)} =(10→10→10→ n ): it is the general process of adding an element 10 to the chain in the chain notation; this process can be repeated again (see also the previous section). Numbering the subsequent versions of this function a number can be described using functions f q k m q k {\displaystyle {f_{qk}}^{m_{qk}}} , nested in lexicographical order with q the most significant number, but with decreasing order for q and for k ; as inner argument yields a sequence of powers ( 10 ↑ n ) p n {\displaystyle (10\uparrow ^{n})^{p_{n}}} with decreasing values of n (where all these numbers are exactly given integers) with at the end a number in ordinary scientific notation. For a number too large to write down in the Conway chained arrow notation it size can be described by the length of that chain, for example only using elements 10 in the chain; in other words, one could specify its position in the sequence 10, 10→10, 10→10→10, .. If even the position in the sequence is a large number same techniques can be applied again. Other notations Some notations for extremely large numbers: Knuth's up-arrow notation , hyperoperators , Ackermann function , including tetration Conway chained arrow notation Steinhaus-Moser notation ; apart from the method of construction of large numbers, this also involves a graphical notation with polygons . Alternative notations, like a more conventional function notation, can also be used with the same functions. Fast-growing hierarchy These notations are essentially functions of integer variables, which increase very rapidly with those integers. Ever-faster-increasing functions can easily be constructed recursively by applying these functions with large integers as argument. A function with a vertical asymptote is not helpful in defining a very large number, although the function increases very rapidly: one has to define an argument very close to the asymptote, i.e. use a very small number, and constructing that is equivalent to constructing a very large number, e.g. the reciprocal. Comparison of base values The following illustrates the effect of a base different from 10, base 100. It also illustrates representations of numbers and the arithmetic. 100 12 = 10 24 {\displaystyle 100^{12}=10^{24}} , with base 10 the exponent is doubled. 100 100 12 = 10 2 ∗ 10 24 {\displaystyle 100^{100^{12}}=10^{2*10^{24}}} , ditto. 100 100 100 12 ≈ 10 10 2 ∗ 10 24 + 0.30103 {\displaystyle 100^{100^{100^{12}}}\approx 10^{10^{2*10^{24}+0.30103}}} , the highest exponent is very little more than doubled (increased by log 10 2). 100 ↑ ↑ 2 = 10 200 {\displaystyle 100\uparrow \uparrow 2=10^{200}} 100 ↑ ↑ 3 = 10 2 × 10 200 {\displaystyle 100\uparrow \uparrow 3=10^{2\times 10^{200}}} 100 ↑ ↑ 4 = ( 10 ↑ ) 2 ( 2 × 10 200 + 0.3 ) = ( 10 ↑ ) 2 ( 2 × 10 200 ) = ( 10 ↑ ) 3 200.3 = ( 10 ↑ ) 4 2.3 {\displaystyle 100\uparrow \uparrow 4=(10\uparrow )^{2}(2\times 10^{200}+0.3)=(10\uparrow )^{2}(2\times 10^{200})=(10\uparrow )^{3}200.3=(10\uparrow )^{4}2.3} 100 ↑ ↑ n = ( 10 ↑ ) n − 2 ( 2 × 10 200 ) = ( 10 ↑ ) n − 1 200.3 = ( 10 ↑ ) n 2.3 < 10 ↑ ↑ ( n + 1 ) {\displaystyle 100\uparrow \uparrow n=(10\uparrow )^{n-2}(2\times 10^{200})=(10\uparrow )^{n-1}200.3=(10\uparrow )^{n}2.3<10\uparrow \uparrow (n+1)} (thus if n is large it seems fair to say that 100 ↑ ↑ n {\displaystyle 100\uparrow \uparrow n} is "approximately equal to" 10 ↑ ↑ n {\displaystyle 10\uparrow \uparrow n} ) 100 ↑ ↑ ↑ 2 = ( 10 ↑ ) 98 ( 2 × 10 200 ) = ( 10 ↑ ) 100 2.3 {\displaystyle 100\uparrow \uparrow \uparrow 2=(10\uparrow )^{98}(2\times 10^{200})=(10\uparrow )^{100}2.3} 100 ↑ ↑ ↑ 3 = 10 ↑ ↑ ( 10 ↑ ) 98 ( 2 × 10 200 ) = 10 ↑ ↑ ( 10 ↑ ) 100 2.3 {\displaystyle 100\uparrow \uparrow \uparrow 3=10\uparrow \uparrow (10\uparrow )^{98}(2\times 10^{200})=10\uparrow \uparrow (10\uparrow )^{100}2.3} 100 ↑ ↑ ↑ n = ( 10 ↑ ↑ ) n − 2 ( 10 ↑ ) 98 ( 2 × 10 200 ) = ( 10 ↑ ↑ ) n − 2 ( 10 ↑ ) 100 2.3 < 10 ↑ ↑ ↑ ( n + 1 ) {\displaystyle 100\uparrow \uparrow \uparrow n=(10\uparrow \uparrow )^{n-2}(10\uparrow )^{98}(2\times 10^{200})=(10\uparrow \uparrow )^{n-2}(10\uparrow )^{100}2.3<10\uparrow \uparrow \uparrow (n+1)} (compare 10 ↑ ↑ ↑ n = ( 10 ↑ ↑ ) n − 2 ( 10 ↑ ) 10 1 < 10 ↑ ↑ ↑ ( n + 1 ) {\displaystyle 10\uparrow \uparrow \uparrow n=(10\uparrow \uparrow )^{n-2}(10\uparrow )^{10}1<10\uparrow \uparrow \uparrow (n+1)} ; thus if n is large it seems fair to say that 100 ↑ ↑ ↑ n {\displaystyle 100\uparrow \uparrow \uparrow n} is "approximately equal to" 10 ↑ ↑ ↑ n {\displaystyle 10\uparrow \uparrow \uparrow n} ) 100 ↑ ↑ ↑ ↑ 2 = ( 10 ↑ ↑ ) 98 ( 10 ↑ ) 100 2.3 {\displaystyle 100\uparrow \uparrow \uparrow \uparrow 2=(10\uparrow \uparrow )^{98}(10\uparrow )^{100}2.3} (compare 10 ↑ ↑ ↑ ↑ 2 = ( 10 ↑ ↑ ) 8 ( 10 ↑ ) 10 1 {\displaystyle 10\uparrow \uparrow \uparrow \uparrow 2=(10\uparrow \uparrow )^{8}(10\uparrow )^{10}1} ) 100 ↑ ↑ ↑ ↑ 3 = 10 ↑ ↑ ↑ ( 10 ↑ ↑ ) 98 ( 10 ↑ ) 100 2.3 {\displaystyle 100\uparrow \uparrow \uparrow \uparrow 3=10\uparrow \uparrow \uparrow (10\uparrow \uparrow )^{98}(10\uparrow )^{100}2.3} (compare 10 ↑ ↑ ↑ ↑ 3 = 10 ↑ ↑ ↑ ( 10 ↑ ↑ ) 8 ( 10 ↑ ) 10 1 {\displaystyle 10\uparrow \uparrow \uparrow \uparrow 3=10\uparrow \uparrow \uparrow (10\uparrow \uparrow )^{8}(10\uparrow )^{10}1} ) 100 ↑ ↑ ↑ ↑ n = ( 10 ↑ ↑ ↑ ) n − 2 ( 10 ↑ ↑ ) 98 ( 10 ↑ ) 100 2.3 {\displaystyle 100\uparrow \uparrow \uparrow \uparrow n=(10\uparrow \uparrow \uparrow )^{n-2}(10\uparrow \uparrow )^{98}(10\uparrow )^{100}2.3} (compare 10 ↑ ↑ ↑ ↑ n = ( 10 ↑ ↑ ↑ ) n − 2 ( 10 ↑ ↑ ) 8 ( 10 ↑ ) 10 1 {\displaystyle 10\uparrow \uparrow \uparrow \uparrow n=(10\uparrow \uparrow \uparrow )^{n-2}(10\uparrow \uparrow )^{8}(10\uparrow )^{10}1} ; if n is large this is "approximately" equal) For a number 10 n {\displaystyle 10^{n}} , one unit change in n changes the result by a factor 10. In a number like 10 6.2 × 10 3 {\displaystyle 10^{\,\!6.2\times 10^{3}}} , with the 6.2 the result of proper rounding using significant figures, the true value of the exponent may be 50 less or 50 more. Hence the result may be a factor 10 50 {\displaystyle 10^{50}} too large or too small. This seems like extremely poor accuracy, but for such a large number it may be considered fair (a large error in a large number may be "relatively small" and therefore acceptable). For very large numbers In the case of an approximation of an extremely large number, the relative error may be large, yet there may still be a sense in which one wants to consider the numbers as "close in magnitude". For example, consider The relative error is a large relative error. However, one can also consider the relative error in the logarithms; in this case, the logarithms (to base 10) are 10 and 9, so the relative error in the logarithms is only 10%. The point is that exponential functions magnify relative errors greatly – if a and b have a small relative error, the relative error is larger, and will have an even larger relative error. The question then becomes: on which level of iterated logarithms to compare two numbers? There is a sense in which one may want to consider to be "close in magnitude". The relative error between these two numbers is large, and the relative error between their logarithms is still large; however, the relative error in their second-iterated logarithms is small: Such comparisons of iterated logarithms are common, e.g., in analytic number theory . One solution to the problem of comparing large numbers is to define classes of numbers, such as the system devised by Robert Munafo, [ 18 ] which is based on different "levels" of perception of an average person. Class 0 – numbers between zero and six – is defined to contain numbers that are easily subitized , that is, numbers that show up very frequently in daily life and are almost instantly comparable. Class 1 – numbers between six and 1,000,000=10 6 – is defined to contain numbers whose decimal expressions are easily subitized, that is, numbers who are easily comparable not by cardinality , but "at a glance" given the decimal expansion. Each class after these are defined in terms of iterating this base-10 exponentiation, to simulate the effect of another "iteration" of human indistinguishability. For example, class 5 is defined to include numbers between 10 10 10 10 6 and 10 10 10 10 10 6 , which are numbers where X becomes humanly indistinguishable from X 2 [ 19 ] (taking iterated logarithms of such X yields indistinguishibility firstly between log( X ) and 2log( X ), secondly between log(log( X )) and 1+log(log( X )), and finally an extremely long decimal expansion whose length can't be subitized). Approximate arithmetic There are some general rules relating to the usual arithmetic operations performed on very large numbers: The sum and the product of two very large numbers are both "approximately" equal to the larger one. ( 10 a ) 10 b = 10 a 10 b = 10 10 b + log 10 ⁡ a {\displaystyle (10^{a})^{\,\!10^{b}}=10^{a10^{b}}=10^{10^{b+\log _{10}a}}}

A very large number raised to a very large power is "approximately" equal to the larger of the following two values: the first value and 10 to the power the second. For example, for very large n {\displaystyle n} there is n n ≈ 10 n {\displaystyle n^{n}\approx 10^{n}} (see e.g. the computation of mega ) and also 2 n ≈ 10 n {\displaystyle 2^{n}\approx 10^{n}} . Thus 2 ↑ ↑ 65536 ≈ 10 ↑ ↑ 65533 {\displaystyle 2\uparrow \uparrow 65536\approx 10\uparrow \uparrow 65533} , see table . Systematically creating ever-faster-increasing sequences Given a strictly increasing integer sequence/function f 0 ( n ) {\displaystyle f_{0}(n)} ( n ≥1), it is possible to produce a faster-growing sequence f 1 ( n ) = f 0 n ( n ) {\displaystyle f_{1}(n)=f_{0}^{n}(n)} (where the superscript n denotes the n th functional power ). This can be repeated any number of times by letting f k ( n ) = f k − 1 n ( n ) {\displaystyle f_{k}(n)=f_{k-1}^{n}(n)} , each sequence growing much faster than the one before it. Thus it is possible to define f ω ( n ) = f n ( n ) {\displaystyle f_{\omega }(n)=f_{n}(n)} , which grows much faster than any f k {\displaystyle f_{k}} for finite k (here ω is the first infinite ordinal number , representing the limit of all finite numbers k). This is the basis for the fast-growing hierarchy of functions, in which the indexing subscript is extended to ever-larger ordinals. For example, starting with f 0 ( n ) = n + 1: f 1 ( n ) = f 0 n ( n ) = n + n = 2 n f 2 ( n ) = f 1 n ( n ) = 2 n n > (2 ↑) n for n ≥ 2 (using Knuth up-arrow notation ) f 3 ( n ) = f 2 n ( n ) > (2 ↑) n n ≥ 2 ↑ 2 n for n ≥ 2 f k +1 ( n ) > 2 ↑ k n for n ≥ 2, k < ω f ω ( n ) = f n ( n ) > 2 ↑ n – 1 n > 2 ↑ n − 2 ( n + 3) − 3 = A ( n , n ) for n ≥ 2, where A is the Ackermann function (of which f ω is a unary version) f ω+1 (64) > f ω 64 (6) > Graham's number (= g 64 in the sequence defined by g 0 = 4, g k +1 = 3 ↑ g k 3) This follows by noting f ω ( n ) > 2 ↑ n – 1 n > 3 ↑ n – 2 3 + 2, and hence f ω ( g k + 2) > g k +1 + 2 This follows by noting f ω ( n ) > 2 ↑ n – 1 n > 3 ↑ n – 2 3 + 2, and hence f ω ( g k + 2) > g k +1 + 2 f ω ( n ) > 2 ↑ n – 1 n = (2 → n → n -1) = (2 → n → n -1 → 1) (using Conway chained arrow notation ) f ω+1 ( n ) = f ω n ( n ) > (2 → n → n -1 → 2) (because if g k ( n ) = X → n → k then X → n → k +1 = g k n (1)) f ω+ k ( n ) > (2 → n → n -1 → k +1) > ( n → n → k ) f ω2 ( n ) = f ω+ n ( n ) > ( n → n → n ) = ( n → n → n → 1) f ω2+ k ( n ) > ( n → n → n → k ) f ω3 ( n ) > ( n → n → n → n ) f ω k ( n ) > ( n → n → ... → n → n ) (Chain of k +1 n' s) f ω 2 ( n ) = f ω n ( n ) > ( n → n → ... → n → n ) (Chain of n +1 n' s) In some noncomputable sequences The busy beaver function Σ is an example of a function which grows faster than any computable function. Its value for even relatively small input is huge. The values of Σ( n ) for n = 1, 2, 3, 4, 5 are 1, 4, 6, 13, 4098 [ 20 ] (sequence A028444 in the OEIS ) . Σ(6) is not known but is at least 10↑↑15. Infinite numbers Although all the numbers discussed above are very large, they are all still finite . Certain fields of mathematics define infinite and transfinite numbers . For example, aleph-null is the cardinality of the infinite set of natural numbers , and aleph-one is the next greatest cardinal number. c {\displaystyle {\mathfrak {c}}} is the cardinality of the real numbers . The proposition that c = ℵ 1 {\displaystyle {\mathfrak {c}}=\aleph _{1}} is known as the continuum hypothesis , which cannot be proven to be either true or false from the usual axioms of set theory . Arbitrary-precision arithmetic – Calculations where numbers' precision is only limited by computer memory Dirac large numbers hypothesis – Hypothesis relating age of the universe to physical constants Exponential growth – Growth of quantities at rate proportional to the current amount History of large numbers Human scale – Concept that takes people as the primary measure of development Indefinite and fictitious numbers Indian numbering system – Indian convention of naming large numbers Infinity – Mathematical concept Law of large numbers – Averages of repeated trials converge to the expected value List of arbitrary-precision arithmetic software Long and short scales – Different meanings for numbers Myriad – Order of magnitude name for 10,000 Names of large numbers Orders of magnitude – Scale of numbers with a fixed ratio Pages displaying short descriptions of redirect targets Power of 10 – Ten raised to an integer power Power of two – Two raised to an integer power Tetration – Arithmetic operation ↑ Darling, David; Banerjee, Agnijo (2018-01-01). Weird Maths: At the Edge of Infinity and Beyond . Harper Collins . ISBN 978-93-5277-990-1 . ↑ Nowlan, Robert A. (2017-04-09). "Chapter 14: Large and Small" (PDF) . Masters of Mathematics: The Problems They Solved, Why These Are Important, and What You Should Know about Them . Brill Publishers (published 2019). p. 220. ISBN 978-94-6300-892-1 . ↑ Kopp, P. E. (2020). Making up Numbers: a history of invention in mathematics . Open Book Publishers. Cambridge, UK: OpenBook Publishers. ISBN 978-1-80064-097-9 . 1 2 Earl, Richard; Nicholson, James (2021). The Concise Oxford Dictionary of Mathematics . Oxford University Press. ISBN 978-0-19-884535-5 . ↑ "Mersenne Prime Discovery - 2^136279841 is Prime!" . Great Internet Mersenne Prime Search . ↑ Bianconi, Eva; Piovesan, Allison; Facchin, Federica; Beraudi, Alina; Casadei, Raffaella; Frabetti, Flavia; Vitale, Lorenza; Pelleri, Maria Chiara; Tassani, Simone (Nov–Dec 2013). "An estimation of the number of cells in the human body" . Annals of Human Biology . 40 (6): 463– 471. doi : 10.3109/03014460.2013.807878 . hdl : 11585/152451 . ISSN 1464-5033 . PMID 23829164 . S2CID 16247166 . ↑ Landenmark HK, Forgan DH, Cockell CS (June 2015). "An Estimate of the Total DNA in the Biosphere" . PLOS Biology . 13 (6) e1002168. doi : 10.1371/journal.pbio.1002168 . PMC 4466264 . PMID 26066900 . ↑ Nuwer R (18 July 2015). "Counting All the DNA on Earth" . The New York Times . New York. ISSN 0362-4331 . Retrieved 2015-07-18 . ↑ Shannon, Claude (March 1950). "XXII. Programming a Computer for Playing Chess" (PDF) . Philosophical Magazine . Series 7. 41 (314). Archived from the original (PDF) on 2010-07-06 . Retrieved 2019-01-25 . ↑ Atoms in the Universe . Universe Today. 30-07-2009. Retrieved 02-03-13. ↑ Page, Don N (2007-01-09). "Susskind's challenge to the Hartle–Hawking no-boundary proposal and possible resolutions" . Journal of Cosmology and Astroparticle Physics . 2007 (01): 004– 004. arXiv : hep-th/0610199 . doi : 10.1088/1475-7516/2007/01/004 . ISSN 1475-7516 . ↑ Information Loss in Black Holes and/or Conscious Beings?, Don N. Page, Heat Kernel Techniques and Quantum Gravity (1995), S. A. Fulling (ed), p. 461. Discourses in Mathematics and its Applications, No. 4, Texas A&M University Department of Mathematics. arXiv : hep-th/9411193 . ISBN 0-9630728-3-8 . ↑ How to Get A Googolplex ↑ Mermin, N. David (1984). "Stirling's formula!". American Journal of Physics . 52 (4): 362– 365. ↑ Dawson, John W. (1999). "Gödel and the Limits of Logic". Scientific American . 280 (6): 76– 81. ↑ Friedman, Harvey M. (2023). "Some independence results related to finite trees". Phil. Trans. R. Soc. A . 381 . ↑ Carl Sagan takes questions more from his 'Wonder and Skepticism' CSICOP 1994 keynote, Skeptical Inquirer Archived December 21, 2016, at the Wayback Machine ↑ "Large Numbers at MROB" . www.mrob.com . Retrieved 2021-05-13 . ↑ "Large Numbers (page 2) at MROB" . www.mrob.com . Retrieved 2021-05-13 . ↑ " [ July 2nd 2024 ] We have proved "BB(5) = 47,176,870" " . The Busy Beaver Challenge . 2024-07-02 . Retrieved 2024-07-04 . Ridiculously Huge Numbers lecture series by David Metzler Hundred thousand Eddington number Skewes's number Graham's number Scientific notation Knuth's up-arrow notation Conway chained arrow notation Steinhaus–Moser notation Hyperoperation Tetration Ackermann function Grzegorczyk hierarchy Fast-growing hierarchy Slow-growing hierarchy Hardy hierarchy Veblen function Extended real number line Indefinite and fictitious numbers Largest known prime number List of numbers Long and short scales Orders of magnitude Root extraction Super-logarithm Ackermann function Conway chained arrow notation Grzegorczyk hierarchy Knuth's up-arrow notation Steinhaus–Moser notation Mathematical notation Articles with short description Short description is different from Wikidata Articles needing additional references from January 2026 All articles needing additional references Articles containing potentially dated statements from 2024 All articles containing potentially dated statements Webarchive template wayback links Articles needing additional references from December 2022 Articles that may be too long from January 2026 All articles that may be too long Pages displaying short descriptions of redirect targets via Module:Annotated link