Binary to Negabinary Converter - Convert Base 2 to Base -2

What Is Negabinary (Base −2)?

Negabinary is a non-standard positional numeral system that uses a base of −2 instead of the conventional positive base 2. Every integer — positive, negative, or zero — can be uniquely expressed in negabinary using only the digits 0 and 1, without requiring a separate sign bit. This makes it a fascinating alternative to two's complement for negative number representation in computer science.

How to Convert Binary to Negabinary

The conversion from standard binary (base 2) to negabinary (base −2) involves two steps:

Decode the binary to decimal: Treat the input as an unsigned base-2 number to get its decimal value.
Encode decimal to negabinary: Repeatedly divide the decimal value by −2. Adjust any negative remainder by adding 2 and adding 1 to the quotient. Collect the remainders from bottom to top.

Example: Convert binary 1010 (decimal 10) to negabinary.

10 ÷ −2 = −5 remainder 0
−5 ÷ −2 = 3 remainder 1 (since −5 = −2×3 + 1)
3 ÷ −2 = −1 remainder 1 (since 3 = −2×(−1) + 1)
−1 ÷ −2 = 1 remainder 1 (since −1 = −2×1 + 1)
1 ÷ −2 = 0 remainder 1 (since 1 = −2×0 + 1... wait: 1 ÷ −2 = −1 r 1 → adjusted: q=0+1=... )

Reading remainders bottom to top: 11110. You can verify: 0×1 + 1×(−2) + 1×4 + 1×(−8) + 1×16 = 0−2+4−8+16 = 10. ✓

Applications of Negabinary

While negabinary is rarely used in mainstream hardware, it appears in:

Computer science theory and abstract data type exploration
Certain digital signal processing algorithms
Mathematics research on numeral systems and combinatorics
Programming challenges and competitions

Frequently Asked Questions

Can negabinary represent all integers without a sign bit?

Yes. Every integer (positive, negative, and zero) has a unique negabinary representation using only 0s and 1s. No explicit sign bit is needed because the alternating sign of the positional weights naturally handles both positive and negative values.

Why does negabinary division sometimes need adjustment?

When dividing by −2, integer division can produce a negative remainder. In negabinary encoding, remainders must always be 0 or 1. If the remainder is negative (e.g. −1), we add 2 to make it positive and add 1 to the quotient to compensate mathematically.

How many bits does negabinary need compared to two's complement?

Negabinary may require more bits than two's complement for the same value because the alternating weight signs mean not all bit patterns are efficient. In the worst case, negabinary needs roughly twice as many bits as two's complement, though for many values the lengths are comparable.

What is the negabinary representation of zero?

Zero in negabinary is simply 0, just like in standard binary. There is only one representation of zero, which is an advantage over one's complement encoding.

Does this tool support signed binary input?

This tool treats the binary input as a standard unsigned binary number (base 2) and converts it to negabinary. If you need to convert a negative integer represented in two's complement or another signed format, first decode it to decimal using the Decode Negative Binary tool, then convert the decimal to negabinary.