CHARACTER 2FDF·U+2FDF

Character Information

Code Point
U+2FDF
HEX
2FDF
Unicode Plane
Basic Multilingual Plane

Character Representations

Click elements to copy
EncodingHexBinary
UTF8
E2 BF 9F
11100010 10111111 10011111
UTF16 (big Endian)
2F DF
00101111 11011111
UTF16 (little Endian)
DF 2F
11011111 00101111
UTF32 (big Endian)
00 00 2F DF
00000000 00000000 00101111 11011111
UTF32 (little Endian)
DF 2F 00 00
11011111 00101111 00000000 00000000
HTML Entity
⿟
URI Encoded
%E2%BF%9F

Description

The Unicode character U+2FDF, also known as the Character 2FDF, serves a specific purpose within the realm of digital text. It is used to represent the "Combining Mark for Smiling Face," which when combined with other characters such as letters or numbers, creates an emoticon of a smiling face. This character has found its way into popular culture and digital communication, being widely used in text messaging, social media platforms, and online forums. The Character 2FDF is also utilized in programming languages and software applications that require the encoding of emoticons or smiley faces to add a human touch to the otherwise cold and mechanical digital communication. While it may seem trivial, this character contributes significantly to the expression of emotions and moods within text-based communication, enhancing the overall experience and making it more engaging for users.

How to type the symbol on Windows

Hold Alt and type 12255 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+2FDF. 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+2FDF to binary: 00101111 11011111. 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 10111111 10011111