Add, subtract, multiply and divide binary integers exactly. Explore fixed-width bitwise operations, signed representations and manageable arithmetic steps.
01 / BINARY INPUTS
Enter 0/1 digits, such as 1010 and 11. Optional signs and 0b prefixes are supported. Arithmetic is exact and does not wrap at a fixed width.
02 / EXACT RESULT
Enter your binary values and calculate to see the exact result.
03 / QUICK EXAMPLE
1010 + 11 = 1101 means 10 + 3 = 13. Integer division 1010 ÷ 11 gives quotient 11 and remainder 1 (10 = 3 × 3 + 1).
All arithmetic uses BigInt, not floating-point or JavaScript’s 32-bit number bitwise operations. Multiplication can produce up to 8,192 result bits. Long numbers wrap and scroll within their result area.
Advanced operations use the selected finite width. NOT flips those bits. Left shift wraps modulo 2 to that width and may change the sign. Unsigned right shift zero-fills, while signed right shift copies the sign bit. These are bit operations, not decimal division rules.
Inputs and calculations stay locally in your browser without uploads or storage.
Enter your values locally; no inputs are uploaded.
Check validation feedback before reviewing the browser-generated result.
Review the explanation, copy supported outputs or reset the workspace.
Choose an operation, enter binary integers and calculate. Advanced options include bitwise operations, shifts, explicit bit width, interpretation and arithmetic steps. Copy the result or Reset.
Exact large-integer arithmetic, clear quotient and remainder, explicit signed/unsigned bit rules and readable representations.
All inputs and calculations stay in your browser without uploads or storage.
Up to 4,096 binary digits per operand. An optional leading + or − sign and optional 0b prefix are supported; use the keyboard minus character. Internal spaces, decimal points and digits other than 0 or 1 are rejected. Arithmetic interprets inputs as signed mathematical integers.
Division is integer division truncated toward zero. A = quotient × divisor + remainder. A nonzero remainder has the dividend's sign and magnitude smaller than the divisor. Division by zero is rejected.
No. All integer arithmetic and bitwise calculations use BigInt. Arithmetic operands support 4,096 binary digits and multiplication can produce 8,192 result bits without floating-point rounding.
Bitwise and shift operations use the explicitly selected width. Unsigned operands must be nonnegative and fit that width. In signed mode, unsigned-looking bit patterns are zero-padded then interpreted as two's complement. Explicit + or − literals must fit the signed numeric range. Decimal results show the selected interpretation; binary and hex show the fixed-width bits.
NOT flips exactly the selected number of bits. Left shift discards high bits modulo 2 to the width. Unsigned right shift zero-fills; signed right shift is arithmetic and sign-extends. Shift counts are decimal integers from 0 to 4,096 and are not reduced modulo 32. Operands that do not fit are rejected, not silently truncated.
Optional column addition/subtraction, shift-and-add multiplication and binary long division are provided for operands up to 16 bits. Signed cases explain sign handling. Larger inputs still calculate exactly, but detailed steps are omitted to keep the interface responsive.