0001000100011010

0001000100011010 is a 16-bit binary string that appears in computing contexts as a literal or bit pattern. In hexadecimal it is 0x111A, and in decimal it equals 4378. The string is composed of four 4-bit groups: 0001 0001 0001 1010, containing five ones in total.

As two bytes in big-endian order, the high byte is 00010001 (0x11) and the low byte is 00011010 (0x1A). In little-endian memory, the two bytes would be stored as 0x1A followed by 0x11. Interpreting the bytes as ASCII codes yields non-printable control characters: 0x11 and 0x1A, so the sequence is not typically used for text data.

In digital design and pedagogy, such a pattern is often used as a simple test vector to illustrate nibble grouping, bit counting, or endianness conversions. If mapped as a 4x4 bitmap, the pattern places ones at positions corresponding to the first three rows’ last column and the last row’s first and third columns, yielding a small, asymmetric motif: ones at (row1, col4), (row2, col4), (row3, col4), and (row4, col1) and (row4, col3).

Because 0001000100011010 has a clear hexadecimal form (0x111A), it is convenient for demonstrating binary-to-hex conversions and basic memory-layout concepts in introductory computing.

See also: binary numeral system, hexadecimal notation, endianness, binary test vectors.