16,807

← 16806 16807 16808 →
← 0 [[{{#expr:{{{1}}}*{{{factor}}}*1000}} (number)|{{#ifeq:{{{1}}}|10|→|{{#expr:{{{1}}}*{{{factor}}}}}k}}]] [[{{#expr:{{{1}}}*{{{factor}}}*1000}} (number)|{{#ifeq:{{{1}}}|10|→|{{#expr:{{{1}}}*{{{factor}}}}}k}}]] [[{{#expr:{{{1}}}*{{{factor}}}*1000}} (number)|{{#ifeq:{{{1}}}|10|→|{{#expr:{{{1}}}*{{{factor}}}}}k}}]] [[{{#expr:{{{1}}}*{{{factor}}}*1000}} (number)|{{#ifeq:{{{1}}}|10|→|{{#expr:{{{1}}}*{{{factor}}}}}k}}]] [[{{#expr:{{{1}}}*{{{factor}}}*1000}} (number)|{{#ifeq:{{{1}}}|10|→|{{#expr:{{{1}}}*{{{factor}}}}}k}}]] [[{{#expr:{{{1}}}*{{{factor}}}*1000}} (number)|{{#ifeq:{{{1}}}|10|→|{{#expr:{{{1}}}*{{{factor}}}}}k}}]] [[{{#expr:{{{1}}}*{{{factor}}}*1000}} (number)|{{#ifeq:{{{1}}}|10|→|{{#expr:{{{1}}}*{{{factor}}}}}k}}]] [[{{#expr:{{{1}}}*{{{factor}}}*1000}} (number)|{{#ifeq:{{{1}}}|10|→|{{#expr:{{{1}}}*{{{factor}}}}}k}}]] [[{{#expr:{{{1}}}*{{{factor}}}*1000}} (number)|{{#ifeq:{{{1}}}|10|→|{{#expr:{{{1}}}*{{{factor}}}}}k}}]] [[{{#expr:{{{1}}}*{{{factor}}}*1000}} (number)|{{#ifeq:{{{1}}}|10|→|{{#expr:{{{1}}}*{{{factor}}}}}k}}]]
Cardinal sixteen thousand eight hundred seven
Ordinal 16807th
(sixteen thousand eight hundred seventh)
Factorization 75
Greek numeral ͵Ϛωζ´
Roman numeral XVMDCCCVII
Binary 1000001101001112
Ternary 2120011113
Quaternary 100122134
Quinary 10142125
Senary 2054516
Octal 406478
Duodecimal 988712
Hexadecimal 41A716
Vigesimal 220720
Base 36 CYV36

16807 is the natural number following 16806 and preceding 16808.

In mathematics

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

In other fields

References

  1. ↑ Sloane, N.J.A. (ed.). "Sequence A000272 (Number of trees on n labeled nodes: n^(n-2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  2. ↑ Lewis, P.A.W.; Goodman A.S. & Miller J.M. (1969). "A pseudo-random number generator for the system/360". IBM Systems Journal. 8: 136–143.
  3. ↑ Schrage, Linus (1979). "A More Portable Fortran Random Number Generator". ACM Transactions on Mathematical Software. 5 (2): 132–138. doi:10.1145/355826.355828.
  4. ↑ Park, S.K.; Miller, K.W. (1988). "Random Number Generators: Good Ones Are Hard To Find" (PDF). Communications of the ACM. 31 (10): 1192–1201. doi:10.1145/63039.63042.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.