GREATER-THAN AND NOT APPROXIMATE·U+2A8A

Character Information

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

Character Representations

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

Description

The Unicode character U+2A8A, known as the "GREATER-THAN AND NOT APPROXIMATE" symbol (≱), plays a crucial role in digital text by representing an inequality relationship that is both greater than and not approximately equal to another value. This mathematical symbol, often used in set theory, logic, and computer science, is primarily employed for comparing ordered pairs or tuples in programming languages and algorithms. The GREATER-THAN AND NOT APPROXIMATE symbol effectively communicates the idea that a value is greater than another value but not within an infinitesimally small range of differences, which can be useful when precision and accuracy are critical in calculations and logical operations.

How to type the symbol on Windows

Hold Alt and type 10890 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+2A8A. 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+2A8A to binary: 00101010 10001010. 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 10001010