1111111110110

1111111110110 is a binary numeral consisting of thirteen bits. In binary notation it reads as 1111111110110, a pattern that can be read from most significant to least significant bit (MSB to LSB) as nine consecutive 1s, followed by 0, then 11, and ending with 0.

As a binary integer, 1111111110110₂ equals 8182 in decimal. This value is 10 less than 2^13 (8192). The bit-length is 13, and the most significant nonzero bit is at position 12. The bit pattern has a Hamming weight (number of 1s) of 11, and the least significant bit is 0, making the number even.

In hexadecimal, the same value is 0x1FF6, which can be derived by grouping the binary digits into four-bit chunks and padding with leading zeros as needed.

Context and usage: such a binary sequence may appear in computer science as a sample data pattern, in memory dumps, or in demonstrations of binary-to-decimal conversion, base change, or bitwise operations. It serves as a representative example of how a thirteen-bit binary number corresponds to a specific decimal value, a hexadecimal representation, and simple properties like parity and bit-length.

Related concepts include binary counting, bitwise arithmetic, and base conversions between binary, decimal, and hexadecimal.