Jump to content

16,807

From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by Citation bot (talk | contribs) at 07:11, 6 April 2021 (Add: s2cid. | Use this bot. Report bugs. | Suggested by Jamesluiz102 | Category:Integers | via #UCB_Category 329/426). The present address (URL) is a permanent link to this version.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
← 16806 16807 16808 →
Cardinalsixteen thousand eight hundred seven
Ordinal16807th
(sixteen thousand eight hundred seventh)
Factorization75
Greek numeral͵Ϛωζ´
Roman numeralXVMDCCCVII
Binary1000001101001112
Ternary2120011113
Senary2054516
Octal406478
Duodecimal988712
Hexadecimal41A716

16807 is the natural number following 16806 and preceding 16808.


In mathematics

[edit]

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

[edit]

References

[edit]
  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 (2): 136–143. doi:10.1147/sj.82.0136.
  3. ^ Schrage, Linus (1979). "A More Portable Fortran Random Number Generator". ACM Transactions on Mathematical Software. 5 (2): 132–138. CiteSeerX 10.1.1.470.6958. doi:10.1145/355826.355828. S2CID 14090729.
  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. S2CID 207575300.
[edit]