APL FUNCTIONAL SYMBOL QUAD NOT EQUAL·U+236F

Character Information

Code Point
U+236F
HEX
236F
Unicode Plane
Basic Multilingual Plane
Category
Other Symbol

Character Representations

Click elements to copy
EncodingHexBinary
UTF8
E2 8D AF
11100010 10001101 10101111
UTF16 (big Endian)
23 6F
00100011 01101111
UTF16 (little Endian)
6F 23
01101111 00100011
UTF32 (big Endian)
00 00 23 6F
00000000 00000000 00100011 01101111
UTF32 (little Endian)
6F 23 00 00
01101111 00100011 00000000 00000000
HTML Entity
⍯
URI Encoded
%E2%8D%AF

Description

The Unicode character U+236F represents the APL FUNCTIONAL SYMBOL QUAD NOT EQUAL (⊄). This symbol is primarily used in digital text for mathematical equations and programming languages, specifically within the context of the APL programming language. It serves as a functional symbol that signifies inequality between two variables or values. The character is derived from the APL (Array Programming Language) developed by Kenneth E. Iverson in the 1960s, which was designed to improve computational efficiency and human productivity in data manipulation and analysis. Despite not being widely used outside of specialized domains, U+236F remains an important character in its niche areas due to its role in mathematical expression and programming.

How to type the symbol on Windows

Hold Alt and type 9071 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+236F. 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+236F to binary: 00100011 01101111. 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 10001101 10101111