115 (number)

115 (one hundred [and] fifteen) is the natural number following 114 and preceding 116.

← 114 115 116 →
[[{{#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)}}}}]] List of numbers — Integers ← 0 100 200 300 400 500 600 700 800 900 →
Cardinal	one hundred fifteen
Ordinal	115th (one hundred fifteenth)
Factorization	5 × 23
Divisors	1, 5, 23, 115
Greek numeral	ΡΙΕ´
Roman numeral	CXV
Binary	11100112
Ternary	110213
Quaternary	13034
Quinary	4305
Senary	3116
Octal	1638
Duodecimal	9712
Hexadecimal	7316
Vigesimal	5F20
Base 36	3736

In mathematics

115 has a square sum of divisors:[1]

${\displaystyle \sigma (115)=1+5+23+115=144=12^{2}.}$

There are 115 different rooted trees with exactly eight nodes,[2] 115 inequivalent ways of placing six rooks on a 6 × 6 chess board in such a way that no two of the rooks attack each other,[3] and 115 solutions to the stamp folding problem for a strip of seven stamps.[4]

115 is also a heptagonal pyramidal number.[5] The 115th Woodall number,

${\displaystyle 115\cdot 2^{115}-1=4\;776\;913\;109\;852\;041\;418\;248\;056\;622\;882\;488\;319,}$

is a prime number.[6]

In science

• The atomic number of the element Moscovium

In other fields

115 is also the fire service emergency number in Mauritius[7] and Italy,[8] and the ambulance emergency number in Vietnam.[9]

See also

• List of highways numbered 115

References

1. Sloane, N. J. A. (ed.). "Sequence A006532 (Numbers n such that sum of divisors of n is a square)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
2. Sloane, N. J. A. (ed.). "Sequence A000081 (Number of rooted trees with n nodes (or connected functions with a fixed point))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
3. Sloane, N. J. A. (ed.). "Sequence A000903 (Number of inequivalent ways of placing n nonattacking rooks on n X n board)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
4. Sloane, N. J. A. (ed.). "Sequence A002369 (Number of ways of folding a strip of n rectangular stamps)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
5. Sloane, N. J. A. (ed.). "Sequence A002413 (Heptagonal (or 7-gonal) pyramidal numbers: n*(n+1)*(5*n-2)/6)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
6. Sloane, N. J. A. (ed.). "Sequence A002234 (Numbers n such that the Woodall number n*2^n - 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
7. Cheong-Lum, Roseline Ng (2009), CultureShock! Mauritius: A Survival Guide to Customs and Etiquette, Marshall Cavendish International Asia Pte Ltd, p. 287, ISBN 9789814435604.
8. DK Eyewitness Travel Guide: Italy, Penguin, 2013, p. 619, ISBN 9781465414946.
9. The Rough Guide to Southeast Asia On A Budget, Penguin, 2014, p. 1286, ISBN 9780241012727.