127 (number)
127 (one hundred [and] twenty-seven) is the natural number following 126 and preceding 128. It is also a prime number.
In mathematicsEdit
File:Centered-hexagonal-127.png
127 as a centered hexagonal number
- As a Mersenne prime, 127 is related to the perfect number 8128. 127 is also the largest known Mersenne prime exponent for a Mersenne number, <math>2^{127}-1</math>, which is also a Mersenne prime. It was discovered by Édouard Lucas in 1876 and held the record for the largest known prime for 75 years.
- <math>2^{127}-1</math> is the largest prime ever discovered by hand calculations as well as the largest known double Mersenne prime.
- Furthermore, 127 is equal to <math>2^{7}-1</math>, and 7 is equal to <math>2^{3}-1</math>, and 3 is the smallest Mersenne prime, making 7 the smallest double Mersenne prime and 127 the smallest triple Mersenne prime.
- There are a total of 127 prime numbers between 2,000 and 3,000.
- 127 is also a cuban prime of the form <math>p=\frac{x^{3}-y^{3}}{x-y}</math>, <math>x=y+1</math>.<ref>{{#invoke:citation/CS1|citation
|CitationClass=web }}</ref> The next prime is 131, with which it comprises a cousin prime. Because the next odd number, 129, is a semiprime, 127 is a Chen prime.<ref>Template:Cite oeis</ref> 127 is greater than the arithmetic mean of its two neighboring primes; thus, it is a strong prime.<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>
- 127 is a centered hexagonal number.<ref>{{#invoke:citation/CS1|citation
|CitationClass=web }}</ref>
- It is the seventh Motzkin number.<ref>{{#invoke:citation/CS1|citation
|CitationClass=web }}</ref>
- 127 is a palindromic prime in nonary and binary.
- 127 is the first Friedman prime in decimal. It is also the first nice Friedman number in decimal, since <math>127=2^{7}-1 \,</math>, as well as binary since <math>1111111 = (1 + 1)^{111} - 1 \,</math> .
- 127 is the sum of the sums of the divisors of the first twelve positive integers.<ref>Template:Cite OEIS</ref>
- 127 is the smallest prime that can be written as the sum of the first two or more odd primes: <math>127 = 3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 + 29</math>.<ref>Template:Cite OEIS. Partial sums of a sequence of odd primes; a(n) = sum of the first n odd primes.</ref>
- 127 is the smallest odd number that cannot be written in the form <math>p+2^{x}</math>, for Template:Mvar is a prime number, and Template:Mvar is an integer, since <math>127 - 2^0=126,</math> <math>127 - 2^1=125,</math> <math>127 - 2^2=123,</math> <math>127 - 2^3=119,</math> <math>127 - 2^4=111,</math> <math>127 - 2^5=95,</math> and <math>127 - 2^6=63</math> are all composite numbers.<ref>Template:Cite OEIS</ref>
- 127 is an isolated prime where neither <math>p-2</math> nor <math>p+2</math> is prime.
- 127 is the smallest digitally delicate prime in binary.<ref>Template:Cite OEIS. Complementing any single bit in the binary representation of these primes produces a composite number.</ref>
- 127 is the 31st prime number and therefore it is the smallest Mersenne prime with a Mersenne prime index.
- 127 is the largest number with the property <math>127 = 1\cdot\textrm{prime}(1) + 2\cdot\textrm{prime}(2) + 7\cdot\textrm{prime}(7),</math> where <math>\textrm{prime}(n)</math> is the Template:Mvarth prime number. There are only two numbers with that property; the other one is 43.
- 127 is equal to <math>\textrm{prime}^{6}(1),</math> where <math>\textrm{prime}(n)</math> is the Template:Mvarth prime number.
- 127 is the number of non-equivalent ways of expressing 10,000 as the sum of two prime numbers.<ref>Template:Cite OEIS</ref>
In other fieldsEdit
- The non-printable "Delete" (DEL) control character in ASCII.
- Linotype (and Intertype) machines used brass matrices with one of 127 possible combinations punched into the top to enable the matrices to return to their proper channel in the magazine.
ReferencesEdit
- Wells, D. The Penguin Dictionary of Curious and Interesting Numbers London: Penguin Group. (1987): 136 - 138