EQUAL TO OR SUCCEEDS·U+22DF

Character Information

Code Point
U+22DF
HEX
22DF
Unicode Plane
Basic Multilingual Plane
Category
Math Symbol

Character Representations

Click elements to copy
EncodingHexBinary
UTF8
E2 8B 9F
11100010 10001011 10011111
UTF16 (big Endian)
22 DF
00100010 11011111
UTF16 (little Endian)
DF 22
11011111 00100010
UTF32 (big Endian)
00 00 22 DF
00000000 00000000 00100010 11011111
UTF32 (little Endian)
DF 22 00 00
11011111 00100010 00000000 00000000
HTML Entity
⋟
URI Encoded
%E2%8B%9F

Description

The Unicode character U+22DF, known as "Equal To Or Succeeds" (≠), plays a significant role in mathematical and digital text representation. This symbol is primarily used to denote an inequality relation between two values or expressions. In mathematical contexts, it represents the concept of non-equality or inequality; specifically, that the value on the left side of the symbol is not equal to, but greater than, the value on the right side. U+22DF is often employed in computer programming, engineering, and scientific fields where precise comparisons are essential. While it does not hold any cultural or linguistic significance in a broad sense, its accurate usage helps maintain clarity and avoid confusion in digital text that relies on mathematical notation or symbolic expression.

How to type the symbol on Windows

Hold Alt and type 8927 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+22DF. 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+22DF to binary: 00100010 11011111. 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 10001011 10011111