Signed: Integer ↗ Binary: -1 910 538 234 Convert the Integer Number to a Signed Binary. Converting and Writing the Base Ten Decimal System Signed Integer as Binary Code (Written in Base Two)

Signed integer number -1 910 538 234(10)
converted and written as a signed binary (base 2) = ?

1. Start with the positive version of the number:

|-1 910 538 234| = 1 910 538 234

2. Divide the number repeatedly by 2:

Keep track of each remainder.

We stop when we get a quotient that is equal to zero.


  • division = quotient + remainder;
  • 1 910 538 234 ÷ 2 = 955 269 117 + 0;
  • 955 269 117 ÷ 2 = 477 634 558 + 1;
  • 477 634 558 ÷ 2 = 238 817 279 + 0;
  • 238 817 279 ÷ 2 = 119 408 639 + 1;
  • 119 408 639 ÷ 2 = 59 704 319 + 1;
  • 59 704 319 ÷ 2 = 29 852 159 + 1;
  • 29 852 159 ÷ 2 = 14 926 079 + 1;
  • 14 926 079 ÷ 2 = 7 463 039 + 1;
  • 7 463 039 ÷ 2 = 3 731 519 + 1;
  • 3 731 519 ÷ 2 = 1 865 759 + 1;
  • 1 865 759 ÷ 2 = 932 879 + 1;
  • 932 879 ÷ 2 = 466 439 + 1;
  • 466 439 ÷ 2 = 233 219 + 1;
  • 233 219 ÷ 2 = 116 609 + 1;
  • 116 609 ÷ 2 = 58 304 + 1;
  • 58 304 ÷ 2 = 29 152 + 0;
  • 29 152 ÷ 2 = 14 576 + 0;
  • 14 576 ÷ 2 = 7 288 + 0;
  • 7 288 ÷ 2 = 3 644 + 0;
  • 3 644 ÷ 2 = 1 822 + 0;
  • 1 822 ÷ 2 = 911 + 0;
  • 911 ÷ 2 = 455 + 1;
  • 455 ÷ 2 = 227 + 1;
  • 227 ÷ 2 = 113 + 1;
  • 113 ÷ 2 = 56 + 1;
  • 56 ÷ 2 = 28 + 0;
  • 28 ÷ 2 = 14 + 0;
  • 14 ÷ 2 = 7 + 0;
  • 7 ÷ 2 = 3 + 1;
  • 3 ÷ 2 = 1 + 1;
  • 1 ÷ 2 = 0 + 1;

3. Construct the base 2 representation of the positive number:

Take all the remainders starting from the bottom of the list constructed above.


1 910 538 234(10) = 111 0001 1110 0000 0111 1111 1111 1010(2)


4. Determine the signed binary number bit length:

The base 2 number's actual length, in bits: 31.

A signed binary's bit length must be equal to a power of 2, as of:

21 = 2; 22 = 4; 23 = 8; 24 = 16; 25 = 32; 26 = 64; ...

The first bit (the leftmost) is reserved for the sign:

0 = positive integer number, 1 = negative integer number


The least number that is:

1) a power of 2

2) and is larger than the actual length, 31,

3) so that the first bit (leftmost) could be zero
(we deal with a positive number at this moment)

=== is: 32.


5. Get the positive binary computer representation on 32 bits (4 Bytes):

If needed, add extra 0s in front (to the left) of the base 2 number, up to the required length, 32:


1 910 538 234(10) = 0111 0001 1110 0000 0111 1111 1111 1010


6. Get the negative integer number representation:

To get the negative integer number representation on 32 bits (4 Bytes),

... change the first bit (the leftmost), from 0 to 1...


Number -1 910 538 234(10), a signed integer number (with sign),
converted from decimal system (from base 10)
and written as a signed binary (in base 2):

-1 910 538 234(10) = 1111 0001 1110 0000 0111 1111 1111 1010

Spaces were used to group digits: for binary, by 4, for decimal, by 3.

More operations on signed integer numbers:

» Signed integer number -1 910 538 235 converted from decimal system (from base 10) and written as a signed binary (in base 2) = ?

» Signed integer number -1 910 538 233 converted from decimal system (from base 10) and written as a signed binary (in base 2) = ?

The latest signed integer numbers (that are written in decimal system, in base ten) converted and written as signed binary numbers

Convert the base ten decimal system integer number -1,048,371, write it as a signed binary written in base two May 17 11:04 UTC (GMT)
Convert the base ten decimal system integer number 50,000,000,000,096, write it as a signed binary written in base two May 17 11:04 UTC (GMT)
Convert the base ten decimal system integer number 561, write it as a signed binary written in base two May 17 11:04 UTC (GMT)
Convert the base ten decimal system integer number -387, write it as a signed binary written in base two May 17 11:04 UTC (GMT)
Convert the base ten decimal system integer number 20,122,017, write it as a signed binary written in base two May 17 11:04 UTC (GMT)
Convert the base ten decimal system integer number -15,934,243, write it as a signed binary written in base two May 17 11:04 UTC (GMT)
Convert the base ten decimal system integer number 8,964, write it as a signed binary written in base two May 17 11:04 UTC (GMT)
Convert the base ten decimal system integer number -4,128,683, write it as a signed binary written in base two May 17 11:04 UTC (GMT)
Convert the base ten decimal system integer number 234,710, write it as a signed binary written in base two May 17 11:04 UTC (GMT)
Convert the base ten decimal system integer number 22,888,505, write it as a signed binary written in base two May 17 11:04 UTC (GMT)
All the decimal system integer numbers (written in base ten) converted and written as signed binary numbers

How to convert signed integers from decimal system to binary code system

Follow the steps below to convert a signed base ten integer number to signed binary:

  • 1. In a signed binary, first bit (the leftmost) is reserved for sign: 0 = positive integer number, 1 = positive integer number. If the number to be converted is negative, start with its positive version.
  • 2. Divide repeatedly by 2 the positive integer number keeping track of each remainder. STOP when we get a quotient that is ZERO.
  • 3. Construct the base 2 representation of the positive number, by taking all the remainders starting from the bottom of the list constructed above. Thus, the last remainder of the divisions becomes the first symbol (the leftmost) of the base two number, while the first remainder becomes the last symbol (the rightmost).
  • 4. Binary numbers represented in computer language have a length of 4, 8, 16, 32, 64, ... bits (power of 2) - if needed, fill in extra '0' bits in front of the base 2 number (to the left), up to the right length; this way the first bit (the leftmost one) is always '0', as for a positive representation.
  • 5. To get the negative reprezentation of the number, simply switch the first bit (the leftmost one), from '0' to '1'.

Example: convert the negative number -63 from decimal system (base ten) to signed binary code system:

  • 1. Start with the positive version of the number: |-63| = 63;
  • 2. Divide repeatedly 63 by 2, keeping track of each remainder, until we get a quotient that is equal to zero:
    • division = quotient + remainder
    • 63 ÷ 2 = 31 + 1
    • 31 ÷ 2 = 15 + 1
    • 15 ÷ 2 = 7 + 1
    • 7 ÷ 2 = 3 + 1
    • 3 ÷ 2 = 1 + 1
    • 1 ÷ 2 = 0 + 1
  • 3. Construct the base 2 representation of the positive number, by taking all the remainders starting from the bottom of the list constructed above:
    63(10) = 11 1111(2)
  • 4. The actual length of base 2 representation number is 6, so the positive binary computer representation length of the signed binary will take in this case 8 bits (the least power of 2 higher than 6) - add extra '0's in front (to the left), up to the required length; this way the first bit (the leftmost one) is to be '0', as for a positive number:
    63(10) = 0011 1111(2)
  • 5. To get the negative integer number representation simply change the first bit (the leftmost), from '0' to '1':
    -63(10) = 1011 1111
  • Number -63(10), signed integer, converted from decimal system (base 10) to signed binary = 1011 1111