Hexadecimal

From Vero - Wikipedia
Jump to navigation Jump to search

Template:Short description Template:Redirect-multi Template:Use dmy dates Template:Numeral systems Hexadecimal (hex for short) is a positional numeral system for representing a numeric value as base 16. For the most common convention, a digit is represented as "0" to "9" like for decimal and as a letter of the alphabet from "A" to "F" (either upper or lower case) for the digits with decimal value 10 to 15.

As typical computer hardware is binary in nature and that hex is power of 2, the hex representation is often used in computing as a dense representation of binary information. A hex digit represents 4 contiguous bits Template:Ndashknown as a nibble.<ref>Template:Cite news</ref> An 8-bit byte is two hex digits, such as Template:Code.

Special notation is often used to indicate that a number is hex. In mathematics, a subscript is typically used to specify the base. For example, the decimal value Template:Val would be expressed in hex as Template:Hexadecimal. In computer programming, various notations are used. In C and many related languages, the prefix 0x is used. For example, 0xTemplate:Hexadecimal.

Written representation

Common convention

Typically, a hex representation convention allows either lower or upper case letters and treats the letter the same regardless of its case.

Often when rendering non-textual data, a value stored in memory is displayed as a sequence of hex digits with spaces that between values. For instance, in the following hex dump, each 8-bit byte is a 2-digit hex number, with spaces between them, while the 32-bit offset at the start is an 8-digit hex number.

<syntaxhighlight lang="hexdump">

00000000 57 69 6B 69 70 65 64 69 61 2C 20 74 68 65 20 66 00000010 72 65 65 20 65 6E 63 79 63 6C 6F 70 65 64 69 61 00000020 20 74 68 61 74 20 61 6E 79 6F 6E 65 20 63 61 6E 00000030 20 65 64 69 74 2C 20 69 6E 63 6C 75 64 69 6E 67 00000040 20 79 6F 75 20 28 61 6E 64 20 6D 65 29 21

</syntaxhighlight>

Identification

There are several conventions for expressing that a number is represented as hex.

  • A decimal subscript can give the base explicitly. For example 15910 indicates decimal 159, 15916 indicates hex 159. Some prefer a text subscript, such as 159decimal and 159hex, or 159d and 159h
  • Template:AnchorIn C and many languages influenced by it, the prefix 0x indicates that the numeric literal after it is in hex, a character of a string or character literal can be expressed as hex with the prefix \x (for example '\x1B' represents the Esc control character) and to output an integer as hex via printf-like function, the format conversion code %X or %x is used
  • Template:AnchorIn Intel-derived assembly languages and Modula-2,<ref>Template:Cite web</ref> hex is denoted with a suffixed Template:Mono or Template:Mono: FFh or 05A3H. Some implementations require a leading zero when the first hex digit character is not a decimal digit, so one would write 0FFh instead of FFh. Some other implementations (such as NASM) allow C-style numbers (0x42)
  • Some assembly languages (Microchip) use the notation H'ABCD' (for ABCD16); similarly, Fortran 95 uses Z'ABCD'
  • Ada and VHDL enclose hex numerals in based "numeric quotes": 16#5A3#, 16#C1F27ED#. For bit vector constants VHDL uses the notation x"5A3", x"C1F27ED".<ref>Template:Cite web</ref>
  • Verilog represents hex constants in the form 8'hFF, where 8 is the number of bits in the value and FF is the hex constant
  • Common Lisp uses the prefixes #x and #16r. Setting the variables *read-base*<ref>Template:Cite web</ref> and *print-base*<ref>Template:Cite web</ref> to 16 can also be used to switch the reader and printer of a Common Lisp system to hex representation for reading and printing numbers. Thus hex numbers can be represented without the #x or #16r prefix code, when the input or output base has been changed to 16.
  • BBC BASIC and Locomotive BASIC use & for hex<ref>BBC BASIC programs are not fully portable to Microsoft BASIC (without modification) since the latter takes & to prefix octal values. (Microsoft BASIC primarily uses &O to prefix octal, and it uses &H to prefix hex, but the ampersand alone yields a default interpretation as an octal prefix.</ref>
  • TI-89 and 92 series uses a 0h prefix: 0h5A3, 0hC1F27ED
  • ALGOL 68 uses the prefix 16r to denote hex numbers: 16r5a3, 16rC1F27ED. Binary, quaternary (base-4), and octal numbers can be specified similarly.
  • The most common format for hex on IBM mainframes (zSeries) and midrange computers (IBM i) running the traditional OS's (zOS, zVSE, zVM, TPF, IBM i) is X'5A3' or X'C1F27ED', and is used in Assembler, PL/I, COBOL, JCL, scripts, commands and other places. This format was common on other (and now obsolete) IBM systems as well. Occasionally quotation marks were used instead of apostrophes.

Implicit

In some contexts, a number is always written as hex, and therefore, needs no identification notation.

Alternative symbols

Bruce Alan Martin's hex notation proposal<ref name="Martin_1968" />
Ronald O. Whitaker's hex notation proposal.<ref name="Whitaker_1972" /><ref name="Whitaker_1975" />

Notable other hexadecimal representations that use symbols other than letters "A" through "F" to represent the digits above 9 include:

  • The SWAC (1950)<ref name="Savard_2018_CA"/> and Bendix G-15 (1956)<ref name="Bendix"/><ref name="Savard_2018_CA"/> computers used the lowercase letters u, v, w, x, y and z for the values 10 to 15.
  • The ORDVAC and ILLIAC I (1952) computers (and some derived designs, e.g. BRLESC) used the uppercase letters K, S, N, J, F and L for the values 10 to 15.<ref name="Illiac-I"/><ref name="Savard_2018_CA"/>
  • The Librascope LGP-30 (1956) used the letters F, G, J, K, Q and W for the values 10 to 15.<ref name="RP_1957_LGP-30"/><ref name="Savard_2018_CA"/>
  • On the PERM (1956) computer, hex numbers were written as letters O for zero, A to N and P for 1 to 15. Many machine instructions had mnemonic hex-codes (A=add, M=multiply, L=load, F=fixed-point etc.); programs were written without instruction names.<ref name="PERM"/>
  • The Honeywell Datamatic D-1000 (1957) used the lowercase letters b, c, d, e, f, and g whereas the Elbit 100 (1967) used the uppercase letters B, C, D, E, F and G for the values 10 to 15.<ref name="Savard_2018_CA"/>
  • The Monrobot XI (1960) used the letters S, T, U, V, W and X for the values 10 to 15.<ref name="Savard_2018_CA"/>
  • The NEC parametron computer NEAC 1103 (1960) used the letters D, G, H, J, K (and possibly V) for values 10–15.<ref name="NEC_1960_NEAC-1103">Template:Cite book</ref>
  • The Pacific Data Systems 1020 (1964) used the letters L, C, A, S, M and D for the values 10 to 15.<ref name="Savard_2018_CA"/>
  • In 1972, Ronald O. Whitaker of Rowco Engineering Co. proposed a triangular font that allows "direct binary reading" to "permit both input and output from computers without respect to encoding matrices."<ref name="Whitaker_1972">Template:Cite news (1 page)</ref><ref name="Whitaker_1975">Template:Cite web (7 pages)</ref>
  • Some seven-segment display decoder chips (i.e., 74LS47) show unexpected output due to logic designed only to produce 0–9 correctly.<ref>Template:Cite web (29 pages)</ref>

Template:Wide image

Sign

The hex system can express negative numbers the same way as in decimal, by putting a minus sign (−) before the number to indicate that it is negative.

Bit pattern

Hex can express the bit pattern in a processor, so a sequence of hex digits may represent a signed or even a floating-point value. This way, the negative number −4210 can be written as FFFF FFD6 in a 32-bit CPU register (in two's complement), as C228 0000 in a 32-bit FPU register or C045 0000 0000 0000 in a 64-bit FPU register (in the IEEE floating-point standard).

Exponential notation

Just as decimal numbers can be represented in exponential notation, so too can hex numbers. P notation uses the letter P (or p, for "power"), whereas E (or e) serves a similar purpose in decimal E notation. The number after the P is decimal and represents the binary exponent. Increasing the exponent by 1 multiplies by 2, not 16: Template:Mono. Usually, the number is normalized so that the hex digits start with Template:Mono (zero is usually Template:Mono with no P).

Example: Template:Mono represents Template:Math.

P notation is required by the IEEE 754-2008 binary floating-point standard and can be used for floating-point literals in the C99 edition of the C programming language.<ref>Template:Cite web</ref> Using the %a or %A conversion specifiers, this notation can be produced by implementations of the printf family of functions following the C99 specification<ref name="Rationale_2003_C">Template:Cite web</ref> and Single Unix Specification (IEEE Std 1003.1) POSIX standard.<ref name="printf_2013">Template:Cite web</ref>

Verbal representation

Hex finger-counting scheme

Since there were no traditional numerals to represent the quantities from ten to fifteen, alphabetic letters were re-employed as a substitute. Most European languages lack non-decimal-based words for some of the numerals eleven to fifteen. Some people read hex numbers digit by digit, like a phone number, or using the NATO phonetic alphabet, the Joint Army/Navy Phonetic Alphabet, or a similar ad hoc system. In the wake of the adoption of hex among IBM System/360 programmers, Magnuson (1968)<ref name=Magnuson-1968-01/> suggested a pronunciation guide that gave short names to the letters of hex – for instance, "A" was pronounced "ann", B "bet", C "chris", etc.<ref name=Magnuson-1968-01>Template:Cite magazine</ref> Another naming-system was published online by Rogers (2007)<ref name=Rogers-2007>Template:Cite web</ref> that tries to make the verbal representation distinguishable in any case, even when the actual number does not contain numbers A–F. Examples are listed in the tables below. Yet another naming system was elaborated by Babb (2015), based on a joke in Silicon Valley.<ref name=Babb-2015>Template:Cite web</ref> The system proposed by Babb was further improved by Atkins-Bittner in 2015-2016.<ref name="Atkins-Bittner 2015">Template:Cite web</ref>

Others have proposed using the verbal Morse code conventions to express four-bit hex digits, with "dit" and "dah" representing zero and one, respectively, so that "0000" is voiced as "dit-dit-dit-dit" (....), dah-dit-dit-dah (-..-) voices the digit with a value of nine, and "dah-dah-dah-dah" (----) voices the hex digit for decimal 15.

Systems of counting on digits have been devised for both binary and hex. Arthur C. Clarke suggested using each finger as an on/off bit, allowing finger counting from zero to 102310 on ten fingers.<ref>Template:Cite book</ref> Another system for counting up to FF16 (25510) is illustrated on the right.

Magnuson (1968)<ref name=Magnuson-1968-01/>
naming method
Hex Name Decimal
A ann 10
B bet 11
C chris 12
D dot 13
E ernest 14
F frost 15
1A annteen 26
A0 annty 160
5B fifty bet 91
A,01C annty
christeen
40,990
1,AD0 annteen
dotty
6,864
3,A7D thirty ann
seventy dot
14,973
Rogers (2007)<ref name=Rogers-2007/>
naming method
Hex Name Decimal
A ten 10
B eleven 11
C twelve 12
D draze 13
E eptwin 14
F fim 15
10 tex 16
11 oneteek 17
1F fimteek 31
50 fiftek 80
C0 twelftek 192
100 hundrek 256
1,000 thousek 4,096
3E thirtek eptwin 62
E1 eptek one 225
C4A twelve hundrek
fourtek ten
3,146
1,743 one thousek
seven hundrek
fourtek three
5,955
Atkins-Bittner (2015)Template:R
naming method
Hex Name Decimal
A ae 10
B bee 11
C cee 12
D dee 13
E ee 14
F eff 15
A0 atta 160
B0 bitta 176
C0 citta 192
D0 dickety 208
E0 eckity 224
F0 fleventy 240
1A abteen 26
1B bibteen 27
1C cibteen 28
1D dibbleteen 29
1E ebbleteen 30
1F fleventeen 31
100 one bitey 256
10,000 one millby 65,536
Template:Small one billby Template:Small

Conversion

Binary conversion

The programmable RPN-calculator HP-16C Computer Scientist from 1982 was designed for programmers. One of its key features was the conversion between different numeral systems (note hex number in display).

Most computers manipulate binary data, but it is difficult for humans to work with a large number of digits for even a relatively small binary number. Although most humans are familiar with the base 10 system, it is much easier to map binary to hex than to decimal because each hex digit maps to a whole number of bits (410). This example converts 11112 to base ten. Since each position in a binary numeral can contain either a 1 or a 0, its value may be easily determined by its position from the right:

  • 00012 = 110
  • 00102 = 210
  • 01002 = 410
  • 10002 = 810

Therefore:

11112 = 810 + 410 + 210 + 110
  = 1510

With little practice, mapping 11112 to F16 in one step becomes easy. The advantage of using hex rather than decimal increases rapidly with the size of the number. When the number becomes large, conversion to decimal is very tedious. However, when mapping to hex, it is trivial to regard the binary string as 4-digit groups and map each to a single hex digit.<ref name=Mano-Ciletti/>

This example shows the conversion of a binary number to decimal, mapping each digit to the decimal value, and adding the results.

(1001011100)2 = 51210 + 6410 + 1610 + 810 + 410
  = 60410

Compare this to the conversion to hex, where each group of four digits can be considered independently and converted directly:

(1001011100)2 = 0010  0101  11002
  = 2 5 C16
  = 25C16

The conversion from hex to binary is equally direct.<ref name=Mano-Ciletti>Template:Cite book</ref>

Other simple conversions

Although quaternary (base 4) is little used, it can easily be converted to and from hex or binary. Each hex digit corresponds to a pair of quaternary digits, and each quaternary digit corresponds to a pair of binary digits. In the above example 2 5 C16 = 02 11 304.

The octal (base 8) system can also be converted with relative ease, although not quite as trivially as with bases 2 and 4. Each octal digit corresponds to three binary digits, rather than four. Therefore, we can convert between octal and hex via an intermediate conversion to binary followed by regrouping the binary digits in groups of either three or four.

Division-remainder in source base

As with all bases there is a simple algorithm for converting a representation of a number to hex by doing integer division and remainder operations in the source base. In theory, this is possible from any base, but for most humans, only decimal and for most computers, only binary (which can be converted by far more efficient methods) can be easily handled with this method.

Let d be the number to represent in hex, and the series hihi−1...h2h1 be the hex digits representing the number.

  1. i ← 1
  2. hi ← d mod 16
  3. d ← (d − hi) / 16
  4. If d = 0 (return series hi) else increment i and go to step 2

"16" may be replaced with any other base that may be desired.

The following is a JavaScript implementation of the above algorithm for converting any number to a hex in String representation. Its purpose is to illustrate the above algorithm. To work with data seriously, however, it is much more advisable to work with bitwise operators.

<syntaxhighlight lang="javascript"> function toHex(d) {

 var r = d % 16;
 if (d - r == 0) {
   return toChar(r);
 }
 return toHex((d - r) / 16) + toChar(r);

}

function toChar(n) {

 const alpha = "0123456789ABCDEF";
 return alpha.charAt(n);

} </syntaxhighlight>

Conversion through addition and multiplication

A hex multiplication table

It is also possible to make the conversion by assigning each place in the source base the hex representation of its place value Template:Ndashbefore carrying out multiplication and addition to get the final representation. For example, to convert the number B3AD to decimal, one can split the hex number into its digits: B (1110), 3 (310), A (1010) and D (1310), and then get the final result by multiplying each decimal representation by 16p (p being the corresponding hex digit position, counting from right to left, beginning with 0). In this case, we have that:

Template:Math

which is 45997 in base 10.

Tools for conversion

Many computer systems provide a calculator utility capable of performing conversions between the various radices frequently including hex.

In Microsoft Windows, the Calculator, on its Programmer mode, allows conversions between hex and other common programming bases.

Elementary arithmetic

Elementary operations such as division can be carried out indirectly through conversion to an alternate numeral system, such as the commonly used decimal system or the binary system where each hex digit corresponds to four binary digits.

Alternatively, one can also perform elementary operations directly within the hex system itself Template:Ndashby relying on its addition/multiplication tables and its corresponding standard algorithms such as long division and the traditional subtraction algorithm.

Real numbers

Rational numbers

As with other numeral systems, the hex system can be used to represent rational numbers, although repeating expansions are common since sixteen (1016) has only a single prime factor: two.

For any base, 0.1 (or "1/10") is always equivalent to one divided by the representation of that base value in its own number system. Thus, whether dividing one by two for binary or dividing one by sixteen for hex, both of these fractions are written as 0.1. Because the radix 16 is a perfect square (42), fractions expressed in hex have an odd period much more often than decimal ones, and there are no cyclic numbers (other than trivial single digits). Recurring digits are exhibited when the denominator in lowest terms has a prime factor not found in the radix; thus, when using hex notation, all fractions with denominators that are not a power of two result in an infinite string of recurring digits (such as thirds and fifths). This makes hex (and binary) less convenient than decimal for representing rational numbers since a larger proportion lies outside its range of finite representation.

All rational numbers finitely representable in hex are also finitely representable in decimal, duodecimal and sexagesimal: that is, any hex number with a finite number of digits also has a finite number of digits when expressed in those other bases. Conversely, only a fraction of those finitely representable in the latter bases are finitely representable in hex. For example, decimal 0.1 corresponds to the infinite recurring representation 0.1Template:Overline in hex. However, hex is more efficient than duodecimal and sexagesimal for representing fractions with powers of two in the denominator. For example, 0.062510 (one-sixteenth) is equivalent to 0.116, 0.0912, and 0;3,4560.

n Decimal
Prime factors of: base, b = 10: Template:Color, Template:Color;
b − 1 = 9: Template:Color;
b + 1 = 11: Template:Color
Hexadecimal
Prime factors of: base, b = 16Template:Sub = 10: Template:Color; b − 1 = 15Template:Sub = F: Template:Color; b + 1 = 17Template:Sub = 11: Template:Color
Reciprocal Prime factors Positional representation
(decimal)
Positional representation
(hex)
Prime factors Reciprocal
2 1/2 Template:Color 0.5 0.8 Template:Color 1/2
3 1/3 Template:Color 0.3333... = 0.Template:Overline 0.5555... = 0.Template:Overline Template:Color 1/3
4 1/4 Template:Color 0.25 0.4 Template:Color 1/4
5 1/5 Template:Color 0.2 0.Template:Overline Template:Color 1/5
6 1/6 Template:Color, Template:Color 0.1Template:Overline 0.2Template:Overline Template:Color, Template:Color 1/6
7 1/7 7 0.Template:Overline 0.Template:Overline 7 1/7
8 1/8 Template:Color 0.125 0.2 Template:Color 1/8
9 1/9 Template:Color 0.Template:Overline 0.Template:Overline Template:Color 1/9
10 1/10 Template:Color, Template:Color 0.1 0.1Template:Overline Template:Color, Template:Color 1/A
11 1/11 Template:Color 0.Template:Overline 0.Template:Overline B 1/B
12 1/12 Template:Color, Template:Color 0.08Template:Overline 0.1Template:Overline Template:Color, Template:Color 1/C
13 1/13 13 0.Template:Overline 0.Template:Overline D 1/D
14 1/14 Template:Color, 7 0.0Template:Overline 0.1Template:Overline Template:Color, 7 1/E
15 1/15 Template:Color, Template:Color 0.0Template:Overline 0.Template:Overline Template:Color, Template:Color 1/F
16 1/16 Template:Color 0.0625 0.1 Template:Color 1/10
17 1/17 17 0.Template:Overline 0.Template:Overline Template:Color 1/11
18 1/18 Template:Color, Template:Color 0.0Template:Overline 0.0Template:Overline Template:Color, Template:Color 1/12
19 1/19 19 0.Template:Overline 0.Template:Overline 13 1/13
20 1/20 Template:Color, Template:Color 0.05 0.0Template:Overline Template:Color, Template:Color 1/14
21 1/21 Template:Color, 7 0.Template:Overline 0.Template:Overline Template:Color, 7 1/15
22 1/22 Template:Color, Template:Color 0.0Template:Overline 0.0Template:Overline Template:Color, B 1/16
23 1/23 23 0.Template:Overline 0.Template:Overline 17 1/17
24 1/24 Template:Color, Template:Color 0.041Template:Overline 0.0Template:Overline Template:Color, Template:Color 1/18
25 1/25 Template:Color 0.04 0.Template:Overline Template:Color 1/19
26 1/26 Template:Color, 13 0.0Template:Overline 0.0Template:Overline Template:Color, D 1/1A
27 1/27 Template:Color 0.Template:Overline 0.Template:Overline Template:Color 1/1B
28 1/28 Template:Color, 7 0.03Template:Overline 0.0Template:Overline Template:Color, 7 1/1C
29 1/29 29 0.Template:Overline 0.Template:Overline 1D 1/1D
30 1/30 Template:Color, Template:Color, Template:Color 0.0Template:Overline 0.0Template:Overline Template:Color, Template:Color, Template:Color 1/1E
31 1/31 31 0.Template:Overline 0.Template:Overline 1F 1/1F
32 1/32 Template:Color 0.03125 0.08 Template:Color 1/20
33 1/33 Template:Color, Template:Color 0.Template:Overline 0.Template:Overline Template:Color, B 1/21
34 1/34 Template:Color, 17 0.0Template:Overline 0.0Template:Overline Template:Color, Template:Color 1/22
35 1/35 Template:Color, 7 0.0Template:Overline 0.Template:Overline Template:Color, 7 1/23
36 1/36 Template:Color, Template:Color 0.02Template:Overline 0.0Template:Overline Template:Color, Template:Color 1/24
37 1/37 37 0.Template:Overline 0.Template:Overline 25 1/25
38 1/38 Template:Color, 19 0.0Template:Overline 0.0Template:Overline Template:Color, 13 1/26
39 1/39 Template:Color, 13 0.0Template:Overline 0.0Template:Overline Template:Color, D 1/27
40 1/40 Template:Color, Template:Color 0.025 0.0Template:Overline Template:Color, Template:Color 1/28
41 1/41 41 0.0Template:Overline 0.0Template:Overline 29 1/29
42 1/42 Template:Color, Template:Color, 7 0.0Template:Overline 0.0Template:Overline Template:Color, Template:Color, 7 1/2A
43 1/43 43 0.0Template:Overline 0.0Template:Overline 2B 1/2B
44 1/44 Template:Color, Template:Color 0.02Template:Overline 0.05Template:Overline Template:Color, B 1/2C
45 1/45 Template:Color, Template:Color 0.0Template:Overline 0.0Template:Overline Template:Color, 5 1/2D
46 1/46 Template:Color, 23 0.0Template:Overline 0.0Template:Overline Template:Color, 17 1/2E
47 1/47 47 0.0Template:Overline 0.0Template:Overline 2F 1/2F
48 1/48 Template:Color, Template:Color 0.0208Template:Overline 0.0Template:Overline Template:Color, Template:Color 1/30

Irrational numbers

The table below gives the expansions of some common irrational numbers in decimal and hex.

Number Positional representation
Decimal Hex
√2 (the length of the diagonal of a unit square) Template:Val... 1.6A09E667F3BCD...
√3 (the length of the diagonal of a unit cube) Template:Val... 1.BB67AE8584CAA...
√5 (the length of the diagonal of a 1×2 rectangle) Template:Val... 2.3C6EF372FE95...
Template:Mvar (phi, the golden ratio = Template:Math) Template:Val... 1.9E3779B97F4A...
Template:Mvar (pi, the ratio of circumference to diameter of a circle) Template:Val
Template:Val...
3.243F6A8885A308D313198A2E0
3707344A4093822299F31D008...
Template:Mvar (the base of the natural logarithm) Template:Val... 2.B7E151628AED2A6B...
Template:Mvar (the Thue–Morse constant) Template:Val... 0.6996 9669 9669 6996...
Template:Mvar (the limiting difference between the harmonic series and the natural logarithm) Template:Val... 0.93C467E37DB0C7A4D1B...

Powers

The first 16 powers of 2 are below as hex to show relative simplicity compared to decimal representation.

2x Hex Decimal
20 1 1
21 2 2
22 4 4
23 8 8
24 10 16
25 20 32
26 40 64
27 80 128
28 100 256
29 200 512
2Template:Sup 400 1,024
2Template:Sup 800 2,048
2Template:Sup 1,000 4,096
2Template:Sup 2,000 8,192
2Template:Sup 4,000 16,384
2Template:Sup 8,000 32,768
2Template:Sup 10,000 65,536

Cultural history

The traditional Chinese units of measurement were base-16. For example, one jīn (斤) in the old system equals sixteen taels. The suanpan (Chinese abacus) can be used to perform hex calculations such as additions and subtractions.<ref>Template:Cite web</ref>

As with the duodecimal system, there have been occasional attempts to promote hex as the preferred numeral system. These attempts often propose specific pronunciation and symbols for the individual numerals.<ref>Template:Cite web</ref> Some proposals unify standard measures so that they are multiples of 16.<ref>Template:Cite web</ref><ref>Template:Cite web</ref> An early such proposal was put forward by John W. Nystrom in Project of a New System of Arithmetic, Weight, Measure and Coins: Proposed to be called the Tonal System, with Sixteen to the Base, published in 1862.<ref name="nystrom">Template:Cite book</ref> Nystrom among other things suggested hexadecimal time, which subdivides a day by 16, so that there are 16 "hours" (or "10 tims", pronounced tontim) in a day.<ref>Nystrom (1862), p. 33: "In expressing time, angle of a circle, or points on the compass, the unit tim should be noted as integer, and parts thereof as tonal fractions, as 5·86 tims is five times and metonby [*"sutim and metonby" John Nystrom accidentally gives part of the number in decimal names; in Nystrom's pronunciation scheme, 5=su, 8=me, 6=by, c.f. unifoundry.com Template:Webarchive ]."</ref>

Template:AnchorTemplate:Wiktionary The word hexadecimal is first recorded in 1952.<ref>C. E. Fröberg, Hexadecimal Conversion Tables, Lund (1952).</ref> It is macaronic in the sense that it combines Greek ἕξ (hex) "six" with Latinate -decimal. The all-Latin alternative sexadecimal (compare the word sexagesimal for base 60) is older, and sees at least occasional use from the late 19th century.<ref> The Century Dictionary of 1895 has sexadecimal in the more general sense of "relating to sixteen". An early explicit use of sexadecimal in the sense of "using base 16" is found also in 1895, in the Journal of the American Geographical Society of New York, vols. 27–28, p. 197.</ref> It is still in use in the 1950s in Bendix documentation. Schwartzman (1994) argues that use of sexadecimal may have been avoided because of its suggestive abbreviation to sex.<ref>Template:Cite book s.v. hexadecimal</ref> Many western languages since the 1960s have adopted terms equivalent in formation to hexadecimal (e.g. French hexadécimal, Italian esadecimale, Romanian hexazecimal, Serbian хексадецимални, etc.) but others have introduced terms which substitute native words for "sixteen" (e.g. Greek δεκαεξαδικός, Icelandic sextándakerfi, Russian шестнадцатеричной etc.)

Terminology and notation did not become settled until the end of the 1960s. In 1969, Donald Knuth argued that the etymologically correct term would be senidenary, or possibly sedenary, a Latinate term intended to convey "grouped by 16" modelled on binary, ternary, quaternary, etc. According to Knuth's argument, the correct terms for decimal and octal arithmetic would be denary and octonary, respectively.<ref>Knuth, Donald. (1969). The Art of Computer Programming, Volume 2. Template:Isbn. (Chapter 17.)</ref> Alfred B. Taylor used senidenary in his mid-1800s work on alternative number bases, although he rejected base 16 because of its "incommodious number of digits".<ref>Alfred B. Taylor, Report on Weights and Measures, Pharmaceutical Association, 8th Annual Session, Boston, 15 September 1859. See pages and 33 and 41.</ref><ref>Alfred B. Taylor, "Octonary numeration and its application to a system of weights and measures", Proc Amer. Phil. Soc. Vol XXIV Template:Webarchive, Philadelphia, 1887; pages 296–366. See pages 317 and 322.</ref>

The now-current notation using the letters A to F establishes itself as the de facto standard beginning in 1966, in the wake of the publication of the Fortran IV manual for IBM System/360, which (unlike earlier variants of Fortran) recognizes a standard for entering hexadecimal constants.<ref>IBM System/360 FORTRAN IV Language Template:Webarchive (1966), p. 13.</ref> As noted above, alternative notations were used by NEC (1960) and The Pacific Data Systems 1020 (1964). The standard adopted by IBM seems to have become widely adopted by 1968, when Bruce Alan Martin in his letter to the editor of the CACM complains that Template:Blockquote Martin's argument was that use of numerals 0 to 9 in nondecimal numbers "imply to us a base-ten place-value scheme": "Why not use entirely new symbols (and names) for the seven or fifteen nonzero digits needed in octal or hex. Even use of the letters A through P would be an improvement, but entirely new symbols could reflect the binary nature of the system".<ref name="Martin_1968"/> He also argued that "re-using alphabetic letters for numerical digits represents a gigantic backward step from the invention of distinct, non-alphabetic glyphs for numerals sixteen centuries ago" (as Brahmi numerals, and later in a Hindu–Arabic numeral system), and that the recent ASCII standards (ASA X3.4-1963 and USAS X3.4-1968) "should have preserved six code table positions following the ten decimal digits -- rather than needlessly filling these with punctuation characters" (":;<=>?") that might have been placed elsewhere among the 128 available positions.

Base16

Base16 is a binary to text encoding in the family that also contains Base32, Base58, and Base64. Data is broken into 4-bit sequences, and each value (0-15) is encoded as a character. Although any 16 characters could be used, in practice, the ASCII digits "0"–"9" and letters "A"–"F" (or "a"–"f") are used to align with the typical notation for hex numbers.

Support for Base16 encoding is ubiquitous in modern computing. It is the basis for the W3C standard for URL percent encoding, where a character is replaced with a percent sign "%" and its Base16-encoded form. Most modern programming languages directly include support for formatting and parsing Base16-encoded numbers.

Advantages of Base16 encoding include:

  • Most programming languages have facilities to parse ASCII-encoded hex
  • Being exactly half a byte, 4-bits is easier to process than the 5 or 6 bits of Base32 and Base64, respectively
  • The notation is well-known; easily understood without needing a symbol lookup table
  • Many CPU architectures have dedicated instructions that allow access to a half-byte (aka nibble), making it more efficient in hardware than Base32 and Base64

Disadvantages include:

  • Space efficiency is only 50%, since each 4-bit value from the original data will be encoded as an 8-bit byte; in contrast, Base32 and Base64 encodings have a space efficiency of 63% and 75% respectively
  • Complexity of accepting both upper and lower case letters

See also

References

<references> <ref name="Savard_2018_CA">Template:Cite web</ref> <ref name="Bendix">Template:Cite book</ref> <ref name="Illiac-I">Template:Cite web</ref> <ref name="RP_1957_LGP-30">Template:Cite book (NB. This somewhat odd sequence was from the next six sequential numeric keyboard codes in the LGP-30's 6-bit character code.)</ref> <ref name="PERM">Template:Cite web</ref> </references>