APPROXIMATELY EQUAL OR EQUAL TO·U+2A70

Character Information

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

Character Representations

Click elements to copy
EncodingHexBinary
UTF8
E2 A9 B0
11100010 10101001 10110000
UTF16 (big Endian)
2A 70
00101010 01110000
UTF16 (little Endian)
70 2A
01110000 00101010
UTF32 (big Endian)
00 00 2A 70
00000000 00000000 00101010 01110000
UTF32 (little Endian)
70 2A 00 00
01110000 00101010 00000000 00000000
HTML Entity
⩰
URI Encoded
%E2%A9%B0

Description

The Unicode character U+2A70, known as "APPROXIMATELY EQUAL OR EQUAL TO" (≉), is a typographical symbol that holds significant importance in mathematical equations, specifically within the domain of physics and engineering. This symbol, represented by ≉, is primarily used to depict an approximation or equivalence between two quantities or values that are not precisely equal, but close enough for practical purposes. Although it is a less commonly used symbol compared to others such as "≈" or "=", its unique representation sets it apart and adds value in specific contexts where a distinction needs to be made between exact equality and approximate parity. In digital text, the U+2A70 symbol is particularly useful when discussing physical quantities that have errors due to measurement limitations, rounding, or computational approximations.

How to type the symbol on Windows

Hold Alt and type 10864 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+2A70. 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+2A70 to binary: 00101010 01110000. 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 10101001 10110000