65,536

Last updated
65535 65536 65537
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
Binary 100000000000000002
Ternary 100222200213
Senary 12232246
Octal 2000008
Duodecimal 31B1412
Hexadecimal 1000016

65536 is the natural number following 65535 and preceding 65537.

Contents

65536 is a power of two: (2 to the 16th power).

65536 is the smallest number with exactly 17 divisors (but there are smaller numbers with more than 17 divisors; e.g., 180 has 18 divisors) (sequence A005179 in the OEIS ).

256x256 grid with 65536 squares Empty matrix 256.svg
256×256 grid with 65536 squares

In mathematics

65536 is , so in tetration notation 65536 is 42.

When expressed using Knuth's up-arrow notation, 65536 is , which is equal to , which is equivalent to or .

As is also equal to 4, or ,

can thus be written as , or , or as the pentation, (hyperoperation notation).

65536 is a superperfect number – a number such that σ(σ(n)) = 2n. [1]

A 16-bit number can distinguish 65536 different possibilities. For example, unsigned binary notation exhausts all possible 16-bit codes in uniquely identifying the numbers 0 to 65535. In this scheme, 65536 is the least natural number that can not 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 its decimal representation. [2]

The sum of the unitary divisors of 65536 is prime (1 + 65536 = 65537, which is prime). [3]

65536 is an untouchable number.

In computing

65536 (216) is the number of different values representable in a number of 16 binary digits (or bits), also known as an unsigned short integer in many computer programming systems.

This number is a limit in many common hardware and software implementations, some examples of which are:

Related Research Articles

In computer science, an integer is a datum of integral data type, a data type that represents some range of mathematical integers. Integral data types may be of different sizes and may or may not be allowed to contain negative values. Integers are commonly represented in a computer as a group of binary digits (bits). The size of the grouping varies so the set of integer sizes available varies between different types of computers. Computer hardware nearly always provides a way to represent a processor register or memory address as an integer.

An order of magnitude is an approximation of the logarithm of a value relative to some contextually understood reference value, usually 10, interpreted as the base of the logarithm and the representative of values of magnitude one. Logarithmic distributions are common in nature and considering the order of magnitude of values sampled from such a distribution can be more intuitive. When the reference value is 10, the order of magnitude can be understood as the number of digits in the base-10 representation of the value. Similarly, if the reference value is one of some powers of 2, since computers store data in a binary format, the magnitude can be understood in terms of the amount of computer memory needed to store that value.

Large numbers are numbers significantly larger than those typically used in everyday life, appearing frequently in fields such as mathematics, cosmology, cryptography, and statistical mechanics. They are typically large positive integers, or more generally, large positive real numbers, but may also be other numbers in other contexts. Googology is the study of nomenclature and properties of large numbers.

The BMP file format or bitmap, is a raster graphics image file format used to store bitmap digital images, independently of the display device, especially on Microsoft Windows and OS/2 operating systems.

In mathematics, Knuth's up-arrow notation is a method of notation for very large integers, introduced by Donald Knuth in 1976.

Conway chained arrow notation, created by mathematician John Horton Conway, is a means of expressing certain extremely large numbers. It is simply a finite sequence of positive integers separated by rightward arrows, e.g. .

In computer science, primitive data types are a set of basic data types from which all other data types are constructed. Specifically it often refers to the limited set of data representations in use by a particular processor, which all compiled programs must use. Most processors support a similar set of primitive data types, although the specific representations vary. More generally, "primitive data types" may refer to the standard data types built into a programming language. Data types which are not primitive are referred to as derived or composite.

<span class="mw-page-title-main">Power of two</span> Two raised to an integer power

A power of two is a number of the form 2n where n is an integer, that is, the result of exponentiation with number two as the base and integer n as the exponent.

64 (sixty-four) is the natural number following 63 and preceding 65.

Adler-32 is a checksum algorithm written by Mark Adler in 1995, modifying Fletcher's checksum. Compared to a cyclic redundancy check of the same length, it trades reliability for speed. Adler-32 is more reliable than Fletcher-16, and slightly less reliable than Fletcher-32.

<span class="mw-page-title-main">Tetration</span> Arithmetic operation

In mathematics, tetration is an operation based on iterated, or repeated, exponentiation. There is no standard notation for tetration, though and the left-exponent xb are common.

256 is the natural number following 255 and preceding 257.

IEC 61131-3 is the third part of the international standard IEC 61131 for programmable logic controllers. It was first published in December 1993 by the IEC; the current (third) edition was published in February 2013.

<span class="mw-page-title-main">Pentation</span> Arithmetic operation

In mathematics, pentation is the fifth hyperoperation. Pentation is defined to be repeated tetration, similarly to how tetration is repeated exponentiation, exponentiation is repeated multiplication, and multiplication is repeated addition. The concept of "pentation" was named by English mathematician Reuben Goodstein in 1947, when he came up with the naming scheme for hyperoperations.

65535 is the integer after 65534 and before 65536.

60,000 (sixty thousand) is the natural number that comes after 59,999 and before 60,001. It is a round number. It is the value of (F25).

In number theory, a superperfect number is a positive integer n that satisfies

The number 4,294,967,295 is a whole number equal to 232 − 1. It is a perfect totient number, meaning it is equal to the sum of its iterated totients. It follows 4,294,967,294 and precedes 4,294,967,296. It has a factorization of .

In computer architecture, 16-bit integers, memory addresses, or other data units are those that are 16 bits wide. Also, 16-bit central processing unit (CPU) and arithmetic logic unit (ALU) architectures are those that are based on registers, address buses, or data buses of that size. 16-bit microcomputers are microcomputers that use 16-bit microprocessors.

References

  1. Weisstein, Eric W. "Superperfect Number". MathWorld .
  2. Wells, David (1997). The Penguin Dictionary of Curious and Interesting Numbers (revised ed.). Penguin. ISBN   0-14-026149-4.
  3. 65536 at Prime Pages
  4. "General Purpose Operating System Support for Multiple Page Sizes" (PDF). static.usenix.org. Retrieved 2012-11-02.
  5. Microsoft Help Q120596
  6. "Enable multidex for apps with over 64K methods".