COPTIC OLD NUBIAN DIRECT QUESTION MARK·U+2CFA

Character Information

Code Point
U+2CFA
HEX
2CFA
Unicode Plane
Basic Multilingual Plane
Category
Other Punctuation

Character Representations

Click elements to copy
EncodingHexBinary
UTF8
E2 B3 BA
11100010 10110011 10111010
UTF16 (big Endian)
2C FA
00101100 11111010
UTF16 (little Endian)
FA 2C
11111010 00101100
UTF32 (big Endian)
00 00 2C FA
00000000 00000000 00101100 11111010
UTF32 (little Endian)
FA 2C 00 00
11111010 00101100 00000000 00000000
HTML Entity
⳺
URI Encoded
%E2%B3%BA

Description

The Unicode character U+2CFA, known as the COPTIC OLD NUBIAN DIRECT QUESTION MARK, serves a unique function in digital text. It is specifically employed to represent direct questions in Old Nubian, an extinct language that was spoken by the Nubians of ancient Nubia, which is now divided between Sudan and Egypt. This character enables precise communication of interrogative sentences in texts dealing with historical or linguistic studies related to this ancient culture. Although not commonly used in everyday digital communications, it plays a crucial role for academics and researchers who study the language, history, and cultural heritage of Old Nubian, enabling accurate representation and interpretation of its unique syntactical features.

How to type the symbol on Windows

Hold Alt and type 11514 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+2CFA. 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+2CFA to binary: 00101100 11111010. 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 10110011 10111010