Convert 1 011 001 111 110 147 to a Signed Binary (Base 2)

How to convert 1 011 001 111 110 147(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 1 011 001 111 110 147 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;
  • 1 011 001 111 110 147 ÷ 2 = 505 500 555 555 073 + 1;
  • 505 500 555 555 073 ÷ 2 = 252 750 277 777 536 + 1;
  • 252 750 277 777 536 ÷ 2 = 126 375 138 888 768 + 0;
  • 126 375 138 888 768 ÷ 2 = 63 187 569 444 384 + 0;
  • 63 187 569 444 384 ÷ 2 = 31 593 784 722 192 + 0;
  • 31 593 784 722 192 ÷ 2 = 15 796 892 361 096 + 0;
  • 15 796 892 361 096 ÷ 2 = 7 898 446 180 548 + 0;
  • 7 898 446 180 548 ÷ 2 = 3 949 223 090 274 + 0;
  • 3 949 223 090 274 ÷ 2 = 1 974 611 545 137 + 0;
  • 1 974 611 545 137 ÷ 2 = 987 305 772 568 + 1;
  • 987 305 772 568 ÷ 2 = 493 652 886 284 + 0;
  • 493 652 886 284 ÷ 2 = 246 826 443 142 + 0;
  • 246 826 443 142 ÷ 2 = 123 413 221 571 + 0;
  • 123 413 221 571 ÷ 2 = 61 706 610 785 + 1;
  • 61 706 610 785 ÷ 2 = 30 853 305 392 + 1;
  • 30 853 305 392 ÷ 2 = 15 426 652 696 + 0;
  • 15 426 652 696 ÷ 2 = 7 713 326 348 + 0;
  • 7 713 326 348 ÷ 2 = 3 856 663 174 + 0;
  • 3 856 663 174 ÷ 2 = 1 928 331 587 + 0;
  • 1 928 331 587 ÷ 2 = 964 165 793 + 1;
  • 964 165 793 ÷ 2 = 482 082 896 + 1;
  • 482 082 896 ÷ 2 = 241 041 448 + 0;
  • 241 041 448 ÷ 2 = 120 520 724 + 0;
  • 120 520 724 ÷ 2 = 60 260 362 + 0;
  • 60 260 362 ÷ 2 = 30 130 181 + 0;
  • 30 130 181 ÷ 2 = 15 065 090 + 1;
  • 15 065 090 ÷ 2 = 7 532 545 + 0;
  • 7 532 545 ÷ 2 = 3 766 272 + 1;
  • 3 766 272 ÷ 2 = 1 883 136 + 0;
  • 1 883 136 ÷ 2 = 941 568 + 0;
  • 941 568 ÷ 2 = 470 784 + 0;
  • 470 784 ÷ 2 = 235 392 + 0;
  • 235 392 ÷ 2 = 117 696 + 0;
  • 117 696 ÷ 2 = 58 848 + 0;
  • 58 848 ÷ 2 = 29 424 + 0;
  • 29 424 ÷ 2 = 14 712 + 0;
  • 14 712 ÷ 2 = 7 356 + 0;
  • 7 356 ÷ 2 = 3 678 + 0;
  • 3 678 ÷ 2 = 1 839 + 0;
  • 1 839 ÷ 2 = 919 + 1;
  • 919 ÷ 2 = 459 + 1;
  • 459 ÷ 2 = 229 + 1;
  • 229 ÷ 2 = 114 + 1;
  • 114 ÷ 2 = 57 + 0;
  • 57 ÷ 2 = 28 + 1;
  • 28 ÷ 2 = 14 + 0;
  • 14 ÷ 2 = 7 + 0;
  • 7 ÷ 2 = 3 + 1;
  • 3 ÷ 2 = 1 + 1;
  • 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.

1 011 001 111 110 147(10) = 11 1001 0111 1000 0000 0000 1010 0001 1000 0110 0010 0000 0011(2)


3. Determine the signed binary number bit length:

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

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

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:


1 011 001 111 110 147(10) Base 10 integer number converted and written as a signed binary code (in base 2):

1 011 001 111 110 147(10) = 0000 0000 0000 0011 1001 0111 1000 0000 0000 1010 0001 1000 0110 0010 0000 0011

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

» More ops: Convert 1 011 001 111 110 134, 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 10, 2026 [October]: Signed base 10 integer numbers converted and written as signed binary code. Calculations performed during the month of: October - by our visitors

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