NOT EQUAL TO·U+2260

Character Information

Code Point
U+2260
HEX
2260
Unicode Plane
Basic Multilingual Plane
Category
Math Symbol

Character Representations

Click elements to copy
EncodingHexBinary
UTF8
E2 89 A0
11100010 10001001 10100000
UTF16 (big Endian)
22 60
00100010 01100000
UTF16 (little Endian)
60 22
01100000 00100010
UTF32 (big Endian)
00 00 22 60
00000000 00000000 00100010 01100000
UTF32 (little Endian)
60 22 00 00
01100000 00100010 00000000 00000000
HTML Entity
≠
URI Encoded
%E2%89%A0

Description

The Unicode character U+2260, also known as "NOT EQUAL TO" (≠), plays a crucial role in digital text as a mathematical symbol used to represent the inequality between two values. It is commonly employed in mathematics, science, and engineering disciplines to signify that the values on either side of the symbol are not equal. This symbol has its roots in various scripts across multiple languages and cultures, with the most recognizable form being derived from the Latin alphabet. The "≠" symbol dates back to the 16th century and was first used by the French mathematician François Viète. Today, U+2260 is a vital tool for expressing mathematical relationships and comparisons, ensuring clarity and precision in digital communication across various fields.

How to type the symbol on Windows

Hold Alt and type 8800 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+2260. 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+2260 to binary: 00100010 01100000. 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 10001001 10100000