KANGXI RADICAL SNOUT·U+2F39

Character Information

Code Point
U+2F39
HEX
2F39
Unicode Plane
Basic Multilingual Plane
Category
Other Symbol

Character Representations

Click elements to copy
EncodingHexBinary
UTF8
E2 BC B9
11100010 10111100 10111001
UTF16 (big Endian)
2F 39
00101111 00111001
UTF16 (little Endian)
39 2F
00111001 00101111
UTF32 (big Endian)
00 00 2F 39
00000000 00000000 00101111 00111001
UTF32 (little Endian)
39 2F 00 00
00111001 00101111 00000000 00000000
HTML Entity
⼹
URI Encoded
%E2%BC%B9

Description

The Unicode character U+2F39, known as the Kangxi Radical Snoot, is a crucial component of the Chinese writing system. In digital text, it primarily serves as an indexing and classification element in dictionaries and databases. By categorizing characters based on their structural components, or radicals, the Kangxi Radical Snoot helps streamline the process of searching and understanding these complex scripts. This character is a key aspect of linguistic and cultural studies, as it represents one of the 540 radicals in the Kangxi Dictionary, which was compiled by Chinese scholar Dai Zhen during the Qing dynasty in the early 18th century. The Snoot radical, along with other radicals, has been widely used to analyze and categorize Chinese characters for centuries, contributing significantly to the understanding of the language and its rich history.

How to type the symbol on Windows

Hold Alt and type 12089 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+2F39. 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+2F39 to binary: 00101111 00111001. 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 10111100 10111001