Jump to content

115 (number)

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Dhrm77 (talk | contribs) at 16:16, 30 November 2016 (editing section title.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

← 114 115 116 →
Cardinalone hundred fifteen
Ordinal115th
(one hundred fifteenth)
Factorization5 × 23
Divisors1, 5, 23, 115
Greek numeralΡΙΕ´
Roman numeralCXV
Binary11100112
Ternary110213
Senary3116
Octal1638
Duodecimal9712
Hexadecimal7316

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

In mathematics

115 has a square sum of divisors:

It is unknown whether the set of numbers with this property is infinite, but this would follow from the truth of the Bunyakovsky conjecture on polynomials with infinitely many prime values.[1]

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,

is a prime number.[6]

In science

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

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.