Character Information

Code Point
U+29C1
HEX
29C1
Unicode Plane
Basic Multilingual Plane
Category
Math Symbol

Character Representations

Click elements to copy
EncodingHexBinary
UTF8
E2 A7 81
11100010 10100111 10000001
UTF16 (big Endian)
29 C1
00101001 11000001
UTF16 (little Endian)
C1 29
11000001 00101001
UTF32 (big Endian)
00 00 29 C1
00000000 00000000 00101001 11000001
UTF32 (little Endian)
C1 29 00 00
11000001 00101001 00000000 00000000
HTML Entity
⧁
URI Encoded
%E2%A7%81

Description

The character U+29C1 represents the "Circled Greater-Than" symbol (❵) in Unicode. This special character is primarily utilized in digital text for mathematical expressions and comparisons, where it signifies an inequality greater than. Its unique form sets it apart from a standard greater-than symbol (>), which features a simple rightward arrow. The "Circled Greater-Than" symbol is often employed in mathematical notation systems and programming languages to denote that a value on the left side of the operator is greater than the value on the right. Although not widely used, it serves an essential role for those who need clarity and distinction in their textual representations of inequality relationships, ensuring accurate interpretation by readers and software.

How to type the symbol on Windows

Hold Alt and type 10689 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+29C1. 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+29C1 to binary: 00101001 11000001. 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 10100111 10000001