16,807

From HandWiki
Short description: Natural number
← 16806 16807 16808 →
Cardinalsixteen thousand eight hundred seven
Ordinal16807th
(sixteen thousand eight hundred seventh)
Factorization75
Greek numeralMα͵Ϛωζ´
Roman numeralXVMDCCCVII
Binary1000001101001112
Ternary2120011113
Quaternary100122134
Quinary10142125
Senary2054516
Octal406478
Duodecimal988712
Hexadecimal41A716
Vigesimal220720
Base 36CYV36

16807 is the natural number following 16806 and preceding 16808.

In mathematics

As a number of the form nn2 (16807 = 75), it can be applied in Cayley's formula to count the number of trees with seven labeled nodes.[1][2]

The powers of seven, including this one, feature in problem 79 from the Rhind Mathematical Papyrus, from ancient Egypt circa 1650 BC. It resembles the modern English riddle As I was going to St Ives, which compounds powers of seven up to 74 kittens, but reaching one more step, 75=16807 hekat (an ancient Egyptian unit of measurement for grain).[3] Another puzzle of the same type, with 16807 knives, occurs in Fibonacci's Liber Abaci.[4]

In other fields

Xk+1=16807Xkmod2147483647

References

  1. Sloane, N. J. A., ed. "Sequence A000272 (Number of trees on n labeled nodes: n^(n-2))". OEIS Foundation. https://oeis.org/A000272. 
  2. Aldous, Joan M.; Wilson, Robin J. (2003). Graphs and Applications: An Introductory Approach. Springer Science & Business Media. pp. 164–165. ISBN 9781852332594. 
  3. Maor, Eli (2002). "Recreational Mathematics in Ancient Egypt". Trigonometric Delights. Princeton University Press. pp. 11–14 (in PDF, 1–4). ISBN 978-0-691-09541-7. http://pup.princeton.edu/books/maor/sidebar_a.pdf. Retrieved 2009-04-19. 
  4. Gardner, Bob (August 13, 2023). "2.10. Egypt: A Curious Problem in the Rhind Papyrus". History of Mathematics before 1600 - Class Notes. East Tennessee State University. https://faculty.etsu.edu/gardnerr/3040/Notes-Eves6/Eves6-2-10.pdf. 
  5. Lewis, P.A.W.; Goodman A.S.; Miller J.M. (1969). "A pseudo-random number generator for the system/360". IBM Systems Journal 8 (2): 136–143. doi:10.1147/sj.82.0136. 
  6. Schrage, Linus (1979). "A More Portable Fortran Random Number Generator". ACM Transactions on Mathematical Software 5 (2): 132–138. doi:10.1145/355826.355828. 
  7. Park, S.K.; Miller, K.W. (1988). "Random Number Generators: Good Ones Are Hard To Find". Communications of the ACM 31 (10): 1192–1201. doi:10.1145/63039.63042. http://www.firstpr.com.au/dsp/rand31/p1192-park.pdf.