TRIPLE NESTED GREATER-THAN·U+2AF8

Character Information

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

Character Representations

Click elements to copy
EncodingHexBinary
UTF8
E2 AB B8
11100010 10101011 10111000
UTF16 (big Endian)
2A F8
00101010 11111000
UTF16 (little Endian)
F8 2A
11111000 00101010
UTF32 (big Endian)
00 00 2A F8
00000000 00000000 00101010 11111000
UTF32 (little Endian)
F8 2A 00 00
11111000 00101010 00000000 00000000
HTML Entity
⫸
URI Encoded
%E2%AB%B8

Description

The Unicode character U+2AF8, known as the Triple Nested Greater Than (≽), serves a specialized role in digital text, predominantly within mathematical and scientific domains. Its primary function is to represent an inequality operator with a specific hierarchy or precedence level, enabling it to be used in expressions that demand complex comparisons or calculations. This character is particularly useful in algorithms and programming where precise order of operations must be maintained. It is not commonly encountered outside these contexts, as it lacks cultural, linguistic, or general typographical significance.

How to type the symbol on Windows

Hold Alt and type 11000 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+2AF8. 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+2AF8 to binary: 00101010 11111000. 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 10101011 10111000