8192 (number)
8192 is the natural number following 8191 and preceding 8193.
| ||||
|---|---|---|---|---|
← 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 | eight thousand one hundred ninety-two | |||
| Ordinal | 8192nd (eight thousand one hundred ninety-second) | |||
| Factorization | 213 | |||
| Divisors | 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192 | |||
| Greek numeral | ,ΗΡϞΒ´ | |||
| Roman numeral | VMMMCXCII, or VIIICXCII | |||
| Binary | 100000000000002 | |||
| Ternary | 1020201023 | |||
| Octal | 200008 | |||
| Duodecimal | 48A812 | |||
| Hexadecimal | 200016 | |||
8192 is a power of two: (2 to the 13th power).
Because it is two times a sixth power (8192 = 2 × 46), it is also a Bhaskara twin. That is, 8192 has the property that twice its square is a cube and twice its cube is a square.[1]
In computing
- 8192 (213) is the maximum number of fragments for IPv4 datagram.
References
- Sloane, N. J. A. (ed.). "Sequence A106318 (Bhaskara twins: n such that 2*n^2=X^3 and 2*n^3=Y^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation..
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.