GREATER-THAN AND SINGLE-LINE NOT EQUAL TO·U+2A88

Character Information

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

Character Representations

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

Description

The Unicode character U+2A88 represents the "Greater-Than And Single-Line Not Equal To" symbol (>!=). This mathematical symbol is used in digital text to denote a comparison that is both greater than and not equal to another value. It is commonly employed in programming languages, mathematical equations, and logical statements to illustrate the inequality of two values. While it may seem similar to the "Greater-Than" symbol (>), the addition of the "Single-Line Not Equal To" element emphasizes that the values being compared are not only greater but also not equivalent. This character serves a crucial role in various programming and mathematical contexts, ensuring accurate and precise communication of relationships between numerical or logical entities.

How to type the symbol on Windows

Hold Alt and type 10888 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+2A88. 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+2A88 to binary: 00101010 10001000. 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 10001000