111111111100

111111111100 is a binary numeral consisting of ten consecutive ones followed by two zeros, making it a 12-bit pattern often encountered in computing contexts.

In decimal form, 111111111100 equals 4092. It can also be written as 0xFFC in hexadecimal and 0o7774 in octal. The value can be expressed as the sum of powers of two from 2 to 11: sum_{k=2}^{11} 2^k = 2^{12} - 2^{2} = 4096 - 4 = 4092.

The number is even and not a power of two. Its prime factorization is 2^2 × 3 × 11 × 31. In a 12-bit unsigned context, this pattern represents a bitmask with bits 2 through 11 set to 1, while the two least-significant bits are 0. It is also equal to four times 1023, since 1023 equals 2^10 − 1.

Usage and context: patterns like 111111111100 commonly appear in discussions of bit masking, binary counting, and digital electronics. The corresponding hexadecimal and octal representations (0xFFC and 0o7774) are frequently used in programming and hardware documentation to convey the same bit pattern succinctly.

Related topics include the binary numeral system, bitwise operations, and representations of integers in different bases.