116 (number)
116 (one hundred [and] sixteen) is the natural number following 115 and preceding 117.
| ||||
|---|---|---|---|---|
[[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] [[{{#expr: (floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}} (number)|{{#switch:{{{1}}}|-1={{#ifexpr:(floor({{{number}}} div 10)) = 0|-1|←}}|10=→|#default={{#expr:(floor({{{number}}} div {{{factor}}})) * {{{factor}}}+({{{1}}}*{{{factor}}} div 10)}}}}]] | ||||
| Cardinal | one hundred sixteen | |||
| Ordinal | 116th (one hundred sixteenth) | |||
| Factorization | 22 × 29 | |||
| Divisors | 1, 2, 4, 29, 58, 116 | |||
| Greek numeral | ΡΙϚ´ | |||
| Roman numeral | CXVI | |||
| Binary | 11101002 | |||
| Ternary | 110223 | |||
| Octal | 1648 | |||
| Duodecimal | 9812 | |||
| Hexadecimal | 7416 | |||
In mathematics
116 is a noncototient, meaning that there is no solution to the equation m − φ(m) = n, where φ stands for Euler's totient function.[1]
116! + 1 is a factorial prime.[2]
There are 116 ternary Lyndon words of length six, and 116 irreducible polynomials of degree six over a three-element field, which form the basis of a free Lie algebra of dimension 116.[3]
There are 116 different ways of partitioning the numbers from 1 through 5 into subsets in such a way that, for every k, the union of the first k subsets is a consecutive sequence of integers.[4]
There are 116 different 6×6 Costas arrays.[5]
In other fields
One hundred sixteen is also:
- The prefix for several EU-wide telephone helplines designated as harmonised service of social value
- The atomic number of livermorium
- The number of years that the Hundred Years' War between France and England, from 1337 to 1453, actually lasted
- The fire emergency telephone number in Peru
- The record for number of wins in a single season of Major League Baseball achieved by the Chicago Cubs in 1906 and the Seattle Mariners in 2001.
- The number of pages in the Lost 116 pages, the original manuscript of what Joseph Smith said was the translation of the Book of Lehi, of the Golden plates revealed to him in 1827
- The license plate code for Tatarstan
See also
- List of highways numbered 116
- 116th Street (Manhattan)
- 116th Street Crew, a mafia crew named after the Manhattan street
- The 116 Clique, a group of Christian rappers from Dallas, TX named after the Bible verse Romans 1:16
References
- Sloane, N. J. A. (ed.). "Sequence A005278 (Noncototients: n such that x-phi(x)=n has no solution)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation..
- Sloane, N. J. A. (ed.). "Sequence A002981 (Numbers n such that n! + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation..
- Sloane, N. J. A. (ed.). "Sequence A027376 (Number of ternary irreducible polynomials of degree n; dimensions of free Lie algebras)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation..
- Sloane, N. J. A. (ed.). "Sequence A007052 (Number of order-consecutive partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation..
- Sloane, N. J. A. (ed.). "Sequence A008404 (Number of Costas arrays of order n, counting rotations and flips as distinct)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation..
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.