Notable Properties of Specific Numbers

Introduction

These are some numbers with notable properties. (Most of the less notable properties are listed here.) Other people have compiled similar lists, but this is my list — it includes the numbers that I think are important (-:

A few rules I used in this list:

Everything can be understood by a typical undergraduate college student.

If multiple numbers have a shared property, that property is described under one "representative" number with that property. I try to choose the smallest representative that is not also cited for another property.

When a given number has more than one type of property, the properties are listed in this order:

1. Purely mathematical properties unrelated to the use of base 10 (example: 137 is prime.)

2. Base-10-specific mathematical properties (example: 137 is prime; remove the "1": 37 is also prime; remove the "3": 7 is also prime)

3. Things related to the physical world but outside human culture (example: 137 is close to the reciprocal of the fine-structure constant, once thought to be exact but later found to be closer to 137.036...)

4. All other properties (example: 137 has often been given a somewhat mystical significance due to its proximity to the fine-structure constant, most famously by Eddington)

Due to blatant personal bias, I only discuss positive real numbers on this page. Negative, imaginary, complex, octonions, and so on are here.

The word "zero" is the only number name in English that can be traced back to Arabic. The word came with the symbol, at around the same time the indo-arabic numerals came to Europe.⁴⁴

5.390×10^-44

This is the Planck time in seconds; it is related to quantum mechanics. The best interpretation for most people is that the Planck time is the shortest measurable period of time; any two events that are separated by less than this amount of time can be considered simultaneous. See also 1.6160×10^-35 and 299792458.

1.6160×10^-35

This is the Planck length in meters; it is related to quantum mechanics. The best interpretation for most people is that the Planck length is the smallest measurable length, or the smallest length that has any relevance to events that we can observe. See also 5.390×10^-44 and 299792458.

1.73×10^-15

Approximate "size" of a proton⁷¹, in meters (based on its "charge radius" of 0.875 femtometers). "Size" is a pretty vague concept for particles, and different definitions are needed for different problems. See 10⁴⁰.

0.0072973525692(27)

The fine-structure constant, as given by Gabrielse[132] and Hanneke⁷⁸. The previous best value was 0.0072973525700(52), given by Gabrielse, et. al.[128]. Before that the value was 0.007297352533(27), which for a long time could be found at CODATA⁵⁰, a value that was affected by an error referred to in the 2008 Gabrielse, et. al. paper. There is a lot more about this number on a separate page concerning 137.035....

0.054900

Mean eccentricity of the Moon's orbit — the average variation in the distance of the Moon at perigee (closest point to the Earth) and apogee. Due to the influence of the Sun's gravity the actual eccentricity varies a large amount, going as low as about 0.047 and as high as about 0.070; also the ellipse precesses a full circle every 9 years (see 27.554549878). The eccentricity is greatest when the perigee and apogee coincide with new and full moon. At such times the Moon's distance varies by a total of 14 percent, and its apparent size (area in sky) varies by 30 percent when the size at apogee is compared to the size at perigee. This means that the brightness of the full moon varies by 30 percent over the course of the year. In 2004 the brightest full moon is the one on July 2nd; due to the orbit's precession the brightest full moon in 2006 is a couple months later, Oct 6th.

This change in size is a little too small for people to notice from casual observation (except in solar eclipses, when the Moon sometimes covers the whole sun but at other times produces an annular eclipse). But the eccentricity is large enough to cause major differences in the Moon's speed moving through the sky from one day to the next. When the Moon is near perigee it can move as much as 16.5 degrees in a day; when near apogee it moves only 12 degrees; the mean is 13.2. The cumulative effect of this is that the moon can appear as much as 22 degrees to the east or west of where it would be if the orbit were circular, enough to cause the phases to happen as much as 1.6 days ahead of or behind the prediction made from an ideal circular orbit. It also affects the libration (the apparent "wobbling" of the Moon that enables us to see a little bit of the far side of the moon depending on when you look).

0.065988... = e^-e = (1/e)^e

This is the lowest value of z for which the infinite power tower

z^{z^{z^{z^{z^...}}}}

converges to a finite value. (The highest such value is e^(1/e) = 1.444667...; see that entry for more).

See also 1.202056... and 1.644934....

0.5294805... + 3.342716... i

A reader[140] suggested to me the idea that some people might define "zillion" as "a 1 followed by a zillion zeros". This is kind of like the definition of googolplex but contradicts itself, in that no matter what value you pick for X, 10^X is bigger than X.

However, this is actually only true if we limit X to be an integer (or a real number). If X is allowed to be a complex number, then the equation 10^X=X has infinitely many solutions.

Using Wolfram Alpha[142], put in "10^x=x" and you will get:

x ≅ -0.434294481903251827651 W_n(-2.30258509299404568402)

with a note describing W_k as the "product log function", which is related to the Lambert W function (see 2.50618...). This function is also available in Wolfram Alpha (or in Mathematica) using the name "ProductLog[k, x]" where k is any integer and x is the argument. So if we put in "-0.434294481903251827651 * ProductLog[1, -2.30258509299404568402]", we get:

0.529480508259063653364... - 3.34271620208278281864... i

Finally, put in "10^(0.529480508259063653364 - 3.34271620208278281864 * i)" and get:

0.52948050825906365335... - 3.3427162020827828186... i

If we used -2 as the initial argument of ProductLog[], we get 0.5294805+3.342716i, and in general all the solutions occur as complex conjugate pairs. Other solutions include x=-0.119194...±0.750583...i and x=0.787783...±6.083768...i.

0.1868131868131... = ¹⁷/₉₁

First fraction in Conway's FRACTRAN program that finds all the prime numbers. The complete program is ¹⁷/₉₁, ⁷⁸/₈₅, ¹⁹/₅₁, ²³/₃₈, ²⁹/₃₃, ⁷⁷/₂₉, ⁹⁵/₂₃, ⁷⁷/₁₉, ¹/₁₇, ¹¹/₁₃, ¹³/₁₁, ¹⁵/₂, ¹/₇, ⁵⁵/₁. To "run" the program: starting with X=2, find the first fraction N/D in the sequence for which XN/D is an integer. Use this value NX/D as the new value of X, then repeat. Every time X is set to a power of 2, you've found a prime number, and they will occur in sequence: 2², 2³, 2⁵, 2⁷, 2¹¹ and so on. It's not very efficient though — it takes 19 steps to find the first prime, 69 for the second, then 281, 710, 2375 ... (Sloane's A7547).

0.20787957635... = e^-π/2 = iⁱ

This is e^-π/2, which is also equal to iⁱ. (Because e^ix = cos(x) + isin(x), e^iπ/2=i, and therefore iⁱ = (e^iπ/2)ⁱ = e^i²π/2 = e^-π/2 .)

0.288788095086602421278899721929... = 1/2 × 3/4 × 7/8 × 15/16 × 31/32 × ... × 1-2^-N × ...

This is an infinite product of (1-2^-N) for all N. This is also the product of (1-x^N) with x=1/2. Euler showed that in the general case, this infinite product can be reduced to the much easier-to-calculate infinite sum 1 - x - x² + x⁵ + x⁷ - x¹² - x¹⁵ + x²² + x²⁶ - x³⁵ - x⁴⁰ + ... where the exponents are the pentagonal numbers N(3N-1)/2 (for both positive and negative N), Sloane's A1318.³⁰

0.412454...

If you take a string of 1's and 0's and follow it by its complement (the same string with 1's switched to 0's and vice versa) you get a string twice as long. If you repeat the process forever (starting with 0 as the initial string) you get the sequence

011010011001011010010110...

and if you make this a binary fraction 0.0110100110010110...₂ the equivalent in base 10 is 0.41245403364..., and is called the Thue-Morse constant or the parity constant. Its value is given by a ratio of infinite products:

4 K = 2 - PRODUCT[2^2ⁿ-1] / PRODUCT[2^2ⁿ]
= 2 - (1 × 3 × 15 × 255 × 65535 × ...)/(2 × 4 × 16 × 256 × 65536 × ...)

0.567143290409783872999968662210355549753815787186512508135131...

This is the Omega constant, which satisfies each of these simple equations (all equivalent):

e^x = 1/x		x = ln(1/x) = - ln(x)
e^-x = x		-x = ln(x)
x e^x = 1		x+ln(x) = 0
x^1/x = 1/e		x/ln(x) = -1
x^-1/x = (1/x)^(1/x) = e		ln(x)/-x = 1

Thus it is sort of like the golden ratio. In the above equations, if e is replaced with any number bigger than 1 (and "ln" by the corresponding logarithm) and you get another "Omega" constant. For example:

if 2^x=1/x, then x=0.6411857445...
if π^x=1/x, then x=0.5393434988...
if 4^x=1/x, then x=1/2
if 10^x=1/x, then x=0.3990129782...
if 27^x=1/x, then x=1/3
if 10000000000^x=1/x, then x=1/10

0.5772156649...

This is the Euler-Mascheroni constant, commonly designated by the Greek letter gamma. It is defined in the following way. Consider the sum:

S_n = 1 + 1/2 + 1/3 + 1/4 + 1/5 + ... + 1/n

The sequence starts 1, 1.5, 1.833333..., 2.083333..., etc. As n approaches infinity, the sum approaches ln(n) + gamma.

Here are some not-particularly-significant approximations to gamma:

1/(√π - 1/25) = 0.5772159526...
gamma = 0.5772156649...
1/(1+ 1/√10)² = 0.5772153925...

0.618033... = (√5 - 1) / 2

The golden ratio (reciprocal form): see 1.618033....

0.692200... = (1/e)^(1/e)

This is the lowest point in the function y = x^x. See also 1.444667....

0.709803...

You can create a long string of 1's and 0's by using "substitution rules" and iterating from a small starting string like 0 or 1. If you use the rule:

0 → 1
1 → 10

and start with 0, you get 1, 10, 101, 10110, 10110101, 1011010110110, ... where each string is the previous one followed by the one before that (Sloane's A36299 or A61107). The limit of this is an infinite string of 1's and 0's which you can make this into a binary fraction: 0.1011010110110...₂, you get this constant (0.709803... in base 10) which is called the Rabbit Constant. It has some special relationships to the Fibonacci sequence:

In the iteration described above, the number of digits in each string is the Fibonacci sequence: 1, 1, 2, 3, 5, 8, 13, 21, ...

Expressed as a continued fraction, the constant is 0 + 1/(2⁰ + 1/(2¹ + 1/(2¹ + 1/(2² + 1/(2³ + 1/(2⁵ + 1/(2⁸ + ...))))))) where the exponents of 2 are the Fibonacci numbers.

If you take all the multiples of the Golden Ratio 0.618033 and round them down to integers, you get 1, 3, 4, 6, 8, 9, 11, 12, ...: These numbers tell you where the 1's in the binary fraction are.

0.739085...

Value of x such that x=cos(x), using radians as the unit of angle. You can find the value with a scientific calculator just by putting in any reasonably close number and hitting the cosine key over and over again. Here are a few more digits: 0.7390851332151606416553120876738734040134117589007574649656...²⁶

0.8507361882018672603677977605320666044113994930...

Decimal value of the "regular paperfolding sequence" 1 1 0 1 100 1 1100100 1 110110001100100 1 1101100111001000110110001100100 ... converted to a binary fraction. This sequence of 1's and 0's gives the left and right turns as one walks along a dragon curve. It is the sum of 8^{2^k}/(2^{2^k+2}-1) for all k≥0, a series sum that gives twice as many digits with each additional term.

0.885603...

The minimum value of the Gamma function, the continuous analogue of the factorial function. This is gamma(1.461632...).

0.886226...

This is 1/2 of the square root of π. It is gamma(3/2), and is sometimes also called (1/2)!, the factorial of 1/2.

0.915965...

Catalan's constant, which can be defined by:

G = ∫_(0,1) [ arctan(x) / x dx ]

G = 1 - 1/3² + 1/5² - 1/7² + 1/9² - ...

If you have a 2n × 2n checkerboard and a supply of 2 n² dominoes that are just large enough to cover two squares of the checkerboard, how many ways are there to cover the whole board with the dominoes? For large n, the answer is closely approximated by

f'_n = e^{4 G n² / π}

. . . Forward to page 2 . . . Last page (page 25)

Quick index: if you're looking for a specific number, start with whichever of these is closest: 0.065988... 1 1.618033... 3.141592... 4 12 16 21 24 29 39 46 52 64 68 89 107 137.03599... 158 231 256 365 616 714 1024 1729 4181 10080 45360 262144 1969920 73939133 4294967297 5×10¹¹ 10¹⁸ 5.4×10²⁷ 10⁴⁰ 5.21...×10⁷⁸ 1.29...×10⁸⁶⁵ 10⁴⁰⁰⁰⁰ 10^9152051 10^10³⁶ 10^{10^10¹⁰⁰} — -- footnotes Also, check out my large numbers and integer sequences pages.

Robert Munafo's home pages on HostMDS (c) 1996-2010 Robert P. Munafo. about contact

This work is licensed under a Creative Commons Attribution 2.5 License. Details here s.13