LESS-THAN AND SINGLE-LINE NOT EQUAL TO·U+2A87

Character Information

Code Point
U+2A87
HEX
2A87
Unicode Plane
Basic Multilingual Plane
Category
Math Symbol

Character Representations

Click elements to copy
EncodingHexBinary
UTF8
E2 AA 87
11100010 10101010 10000111
UTF16 (big Endian)
2A 87
00101010 10000111
UTF16 (little Endian)
87 2A
10000111 00101010
UTF32 (big Endian)
00 00 2A 87
00000000 00000000 00101010 10000111
UTF32 (little Endian)
87 2A 00 00
10000111 00101010 00000000 00000000
HTML Entity
⪇
URI Encoded
%E2%AA%87

Description

The Unicode character U+2A87, known as the "LESS-THAN AND SINGLE-LINE NOT EQUAL TO" symbol (<≠), is a crucial component in digital text for expressing mathematical and logical comparisons. It serves to represent an inequality between two values or variables, which is fundamental in various fields such as mathematics, computer programming, and data analysis. This essential symbol allows users to distinguish between equalities and inequalities, making it indispensable for accurate communication of complex relationships and conditions. U+2A87's clear distinction from its counterpart "LESS-THAN AND DOUBLE-LINE NOT EQUAL TO" (U+2260) emphasizes the significance of understanding the difference between single-line and double-line symbols in the realm of mathematics and programming.

How to type the symbol on Windows

Hold Alt and type 10887 on the numpad. Or use Character Map.

  1. Step 1: Determine the UTF-8 encoding bit layout

    The character has the Unicode code point U+2A87. In UTF-8, it is encoded using 3 bytes because its codepoint is in the range of 0x0800 to 0xffff.

    Therefore we know that the UTF-8 encoding will be done over 16 bits within the final 24 bits and that it will have the format: 1110xxxx 10xxxxxx 10xxxxxx
    Where the x are the payload bits.

    UTF-8 Encoding bit layout by codepoint range
    Codepoint RangeBytesBit patternPayload length
    U+0000 - U+007F10xxxxxxx7 bits
    U+0080 - U+07FF2110xxxxx 10xxxxxx11 bits
    U+0800 - U+FFFF31110xxxx 10xxxxxx 10xxxxxx16 bits
    U+10000 - U+10FFFF411110xxx 10xxxxxx 10xxxxxx 10xxxxxx21 bits
  2. Step 2: Obtain the payload bits:

    Convert the hexadecimal code point U+2A87 to binary: 00101010 10000111. Those are the payload bits.

  3. Step 3: Fill in the bits to match the bit pattern:

    Obtain the final bytes by arranging the paylod bits to match the bit layout:
    11100010 10101010 10000111