100000111100000

100000111100000 is a binary numeral consisting of 15 bits. In binary notation it is written as 100000111100000 (often shown with a 0b prefix in programming). Its value in decimal is 16864, and in hexadecimal it is 0x41E0. The bit-length is 15, and the number contains five 1 bits in total: a single most-significant 1 at bit position 14, and a contiguous block of four 1s at positions 8 through 5.

Structurally, the pattern can be described as 1 00000 1111 00000, with zeros on either side of a central four-bit block of ones. This makes it a relatively sparse bit pattern, which can be useful for illustrating bitwise operations or as a test vector in digital logic and software that manipulates binary data.

As a bitmask, the value enables bits 14 and 8–5, while leaving all other bits clear. Such a pattern might appear in examples or exercises involving masking, shifting, or masking-and-combining operations. It is not a standard constant with a widely recognized mathematical meaning, but it can serve as a concrete example for explaining binary arithmetic, hexadecimal representation, or bit-level encoding concepts.

Representations in other common widths include 16-bit and 32-bit forms. A 16-bit representation is 0x41E0, and a 32-bit form is 0x000041E0, both preserving the same bit pattern within a larger zero-padded word. The string serves as a compact reference point for discussing how binary patterns map to numerical and hexadecimal forms.