16807 is the natural number following 16806 and preceding 16808.
| ||||
|---|---|---|---|---|
| Cardinal | sixteen thousand eight hundred seven | |||
| Ordinal | 16807th (sixteen thousand eight hundred seventh) | |||
| Factorization | 75 | |||
| Greek numeral | ͵Ϛωζ´ | |||
| Roman numeral | XVMDCCCVII | |||
| Binary | 1000001101001112 | |||
| Ternary | 2120011113 | |||
| Senary | 2054516 | |||
| Octal | 406478 | |||
| Duodecimal | 988712 | |||
| Hexadecimal | 41A716 | |||
In mathematics
editAs 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- Several authors have suggested a Lehmer random number generator:[2][3][4]
References
edit- ^ 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.
- ^ 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.
- ^ 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.
- ^ 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.