DOES NOT PRECEDE OR EQUAL·U+22E0

Character Information

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

Character Representations

Click elements to copy
EncodingHexBinary
UTF8
E2 8B A0
11100010 10001011 10100000
UTF16 (big Endian)
22 E0
00100010 11100000
UTF16 (little Endian)
E0 22
11100000 00100010
UTF32 (big Endian)
00 00 22 E0
00000000 00000000 00100010 11100000
UTF32 (little Endian)
E0 22 00 00
11100000 00100010 00000000 00000000
HTML Entity
⋠
URI Encoded
%E2%8B%A0

Description

The Unicode character U+22E0, denoted as "DOES NOT PRECEDE OR EQUAL" (⊋), is a mathematical symbol that represents an inequality involving strict partial ordering. It is commonly used in digital text to denote the fact that one relation does not precede or equal another. This symbol plays a vital role in computer science, mathematics, and other disciplines where order or hierarchy are essential concepts. Notably, it has applications in data structures like trees and graphs, and in formal proofs where the concept of strict partial ordering is fundamental. The character U+22E0 is part of the Mathematical Operators block in Unicode, contributing to a comprehensive system that allows for the accurate representation of text across different languages, cultures, and contexts.

How to type the symbol on Windows

Hold Alt and type 8928 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+22E0. 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+22E0 to binary: 00100010 11100000. 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 10100000