KANGXI RADICAL VALLEY·U+2F95

Character Information

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

Character Representations

Click elements to copy
EncodingHexBinary
UTF8
E2 BE 95
11100010 10111110 10010101
UTF16 (big Endian)
2F 95
00101111 10010101
UTF16 (little Endian)
95 2F
10010101 00101111
UTF32 (big Endian)
00 00 2F 95
00000000 00000000 00101111 10010101
UTF32 (little Endian)
95 2F 00 00
10010101 00101111 00000000 00000000
HTML Entity
⾕
URI Encoded
%E2%BE%95

Description

The Kangxi Radical Valley (U+2F95) is a lesser-known character in the Unicode Standard, which plays a significant role in digital text, particularly in the fields of typography and linguistics. In Chinese typography, it serves as one of the 561 standardized components or radicals that form the basis for constructing characters. This radical, specifically designated as "Valley," represents a specific semantic and phonetic aspect related to watercourses or valleys in traditional Chinese writing systems. The Kangxi Radical Valley is particularly relevant when discussing the classification of Chinese characters into their constituent components and radicals, which helps simplify and facilitate the learning and understanding of the complex character system.

How to type the symbol on Windows

Hold Alt and type 12181 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+2F95. 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+2F95 to binary: 00101111 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 10111110 10010101