| ||||
---|---|---|---|---|
Cardinal | sixty-five thousand five hundred thirty-six | |||
Ordinal | 65536th (sixty-five thousand five hundred thirty-sixth) | |||
Factorization | 216 | |||
Divisors | 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536 | |||
Greek numeral | ͵εφλϚ´ | |||
Roman numeral | LXVDXXXVI,lxvdxxxvi | |||
Binary | 100000000000000002 | |||
Ternary | 100222200213 | |||
Senary | 12232246 | |||
Octal | 2000008 | |||
Duodecimal | 31B1412 | |||
Hexadecimal | 1000016 |
65536 is thenatural number following65535 and preceding65537.
65536 is apower of two: (2 to the 16th power).
65536 is the smallest number with exactly 17divisors (but there are smaller numbers with more than 17 divisors; e.g.,180 has 18 divisors) (sequenceA005179 in theOEIS).
65536 is, so intetration notation 65536 is 42.
When expressed usingKnuth's up-arrow notation, 65536 is,which is equal to,which is equivalent toor.
As is also equal to 4, or,
can thus be written as, or, or as the pentation, (hyperoperation notation).
65536 is asuperperfect number – a number such thatσ(σ(n)) = 2n.[1]
A16-bit number can distinguish 65536 different possibilities. For example,unsignedbinary notation exhausts all possible 16-bit codes in uniquely identifying the numbers 0 to 65535. In this scheme, 65536 is the leastnatural number that cannot be represented with 16 bits. Conversely, it is the "first" or smallest positive integer that requires 17 bits.
65536 is the only power of 2 less than 231000 that does not contain the digits 1, 2, 4, or 8 in itsdecimal representation.[2]
The sum of theunitary divisors of 65536 is prime (1 + 65536 =65537, which is prime).[3]
65536 is anuntouchable number.
65,536 (216) is the number of different values representable in a number of 16binary digits (orbits), also known as anunsigned short integer in manycomputer programming systems.
This number is a limit in many common hardware and software implementations, some examples of which are: