DOUBLE LEFT ARC GREATER-THAN BRACKET·U+2995

Character Information

Code Point
U+2995
HEX
2995
Unicode Plane
Basic Multilingual Plane
Category
Open Punctuation

Character Representations

Click elements to copy
EncodingHexBinary
UTF8
E2 A6 95
11100010 10100110 10010101
UTF16 (big Endian)
29 95
00101001 10010101
UTF16 (little Endian)
95 29
10010101 00101001
UTF32 (big Endian)
00 00 29 95
00000000 00000000 00101001 10010101
UTF32 (little Endian)
95 29 00 00
10010101 00101001 00000000 00000000
HTML Entity
⦕
URI Encoded
%E2%A6%95

Description

The Unicode character U+2995, known as the DOUBLE LEFT ARC GREATER-THAN BRACKET, is a typographical symbol used in digital text to enclose and emphasize expressions involving greater than or less than operations. This specialized character finds its application primarily within mathematical equations, computer programming languages, and scientific documents. Its unique design, featuring two leftward arcing brackets on either side of the greater-than symbol (>), visually distinguishes it from other symbols used in digital text, enhancing readability and comprehension for those familiar with its meaning. Although U+2995 may not be as widely recognized or utilized as more common mathematical symbols like the greater than sign (>) or parentheses, it remains a valuable tool within niche fields that demand precision and clarity when representing inequalities and conditional statements.

How to type the symbol on Windows

Hold Alt and type 10645 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+2995. 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+2995 to binary: 00101001 10010101. 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 10100110 10010101