Convert 10 111 101 000 134 to a Signed Binary (Base 2)

How to convert 10 111 101 000 134(10), a signed base 10 integer number? How to write it as a signed binary code in base 2

What are the required steps to convert base 10 integer
number 10 111 101 000 134 to signed binary code (in base 2)?

  • A signed integer, written in base ten, or a decimal system number, is a number written using the digits 0 through 9 and the sign, which can be positive (+) or negative (-). If positive, the sign is usually not written. A number written in base two, or binary, is a number written using only the digits 0 and 1.

1. Divide the number repeatedly by 2:

Keep track of each remainder.

Stop when you get a quotient that is equal to zero.


  • division = quotient + remainder;
  • 10 111 101 000 134 ÷ 2 = 5 055 550 500 067 + 0;
  • 5 055 550 500 067 ÷ 2 = 2 527 775 250 033 + 1;
  • 2 527 775 250 033 ÷ 2 = 1 263 887 625 016 + 1;
  • 1 263 887 625 016 ÷ 2 = 631 943 812 508 + 0;
  • 631 943 812 508 ÷ 2 = 315 971 906 254 + 0;
  • 315 971 906 254 ÷ 2 = 157 985 953 127 + 0;
  • 157 985 953 127 ÷ 2 = 78 992 976 563 + 1;
  • 78 992 976 563 ÷ 2 = 39 496 488 281 + 1;
  • 39 496 488 281 ÷ 2 = 19 748 244 140 + 1;
  • 19 748 244 140 ÷ 2 = 9 874 122 070 + 0;
  • 9 874 122 070 ÷ 2 = 4 937 061 035 + 0;
  • 4 937 061 035 ÷ 2 = 2 468 530 517 + 1;
  • 2 468 530 517 ÷ 2 = 1 234 265 258 + 1;
  • 1 234 265 258 ÷ 2 = 617 132 629 + 0;
  • 617 132 629 ÷ 2 = 308 566 314 + 1;
  • 308 566 314 ÷ 2 = 154 283 157 + 0;
  • 154 283 157 ÷ 2 = 77 141 578 + 1;
  • 77 141 578 ÷ 2 = 38 570 789 + 0;
  • 38 570 789 ÷ 2 = 19 285 394 + 1;
  • 19 285 394 ÷ 2 = 9 642 697 + 0;
  • 9 642 697 ÷ 2 = 4 821 348 + 1;
  • 4 821 348 ÷ 2 = 2 410 674 + 0;
  • 2 410 674 ÷ 2 = 1 205 337 + 0;
  • 1 205 337 ÷ 2 = 602 668 + 1;
  • 602 668 ÷ 2 = 301 334 + 0;
  • 301 334 ÷ 2 = 150 667 + 0;
  • 150 667 ÷ 2 = 75 333 + 1;
  • 75 333 ÷ 2 = 37 666 + 1;
  • 37 666 ÷ 2 = 18 833 + 0;
  • 18 833 ÷ 2 = 9 416 + 1;
  • 9 416 ÷ 2 = 4 708 + 0;
  • 4 708 ÷ 2 = 2 354 + 0;
  • 2 354 ÷ 2 = 1 177 + 0;
  • 1 177 ÷ 2 = 588 + 1;
  • 588 ÷ 2 = 294 + 0;
  • 294 ÷ 2 = 147 + 0;
  • 147 ÷ 2 = 73 + 1;
  • 73 ÷ 2 = 36 + 1;
  • 36 ÷ 2 = 18 + 0;
  • 18 ÷ 2 = 9 + 0;
  • 9 ÷ 2 = 4 + 1;
  • 4 ÷ 2 = 2 + 0;
  • 2 ÷ 2 = 1 + 0;
  • 1 ÷ 2 = 0 + 1;

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

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

10 111 101 000 134(10) = 1001 0011 0010 0010 1100 1001 0101 0101 1001 1100 0110(2)


3. Determine the signed binary number bit length:

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

  • 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, 44,

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

=== is: 64.


4. Get the positive binary computer representation on 64 bits (8 Bytes):

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


10 111 101 000 134(10) Base 10 integer number converted and written as a signed binary code (in base 2):

10 111 101 000 134(10) = 0000 0000 0000 0000 0000 1001 0011 0010 0010 1100 1001 0101 0101 1001 1100 0110

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

Share

» More ops: Convert 10 111 101 000 112, a signed base 10 integer number, write it as a signed binary code (in base 2) equivalent

» Calculations Performed by Our Visitors: Signed base 10 integer numbers converted and written as signed binary code (base 2) equivalents. Data organized on a Monthly Basis

» Month 05, 2026 [May]: Signed base 10 integer numbers converted and written as signed binary code. Calculations performed during the month of: May - by our visitors

» Improve your social skills: Are you using communication by design, or by default? NotebookLM YouTube Video of 6.33 minutes

How to convert signed base 10 integers in decimal 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