TIBETAN MARK RIN CHEN SPUNGS SHAD·U+0F11

Character Information

Code Point
U+0F11
HEX
0F11
Unicode Plane
Basic Multilingual Plane
Category
Other Punctuation

Character Representations

Click elements to copy
EncodingHexBinary
UTF8
E0 BC 91
11100000 10111100 10010001
UTF16 (big Endian)
0F 11
00001111 00010001
UTF16 (little Endian)
11 0F
00010001 00001111
UTF32 (big Endian)
00 00 0F 11
00000000 00000000 00001111 00010001
UTF32 (little Endian)
11 0F 00 00
00010001 00001111 00000000 00000000
HTML Entity
༑
URI Encoded
%E0%BC%91

Description

The Unicode character U+0F11, known as the Tibetan Mark Rin Chen Spungs Shad, holds a significant position in the realm of digital text, particularly in the Tibetan script. This mark is used to denote the sound "rin" in the Tibetan language, which is part of a phonetic system that utilizes special characters to represent consonant-vowel combinations. The U+0F11 character is widely employed in digital communication and documentation within the Tibetan cultural and linguistic context, including religious texts, academic research, and literary works. Its accurate usage enables scholars, authors, and speakers of the Tibetan language to maintain their linguistic heritage while adapting to modern technology and communication platforms.

How to type the symbol on Windows

Hold Alt and type 3857 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+0F11. 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+0F11 to binary: 00001111 00010001. 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:
    11100000 10111100 10010001