Convert 1 101 011 001 110 010 169 to a Signed Binary (Base 2)

How to convert 1 101 011 001 110 010 169(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 101 011 001 110 010 169 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 101 011 001 110 010 169 ÷ 2 = 550 505 500 555 005 084 + 1;
  • 550 505 500 555 005 084 ÷ 2 = 275 252 750 277 502 542 + 0;
  • 275 252 750 277 502 542 ÷ 2 = 137 626 375 138 751 271 + 0;
  • 137 626 375 138 751 271 ÷ 2 = 68 813 187 569 375 635 + 1;
  • 68 813 187 569 375 635 ÷ 2 = 34 406 593 784 687 817 + 1;
  • 34 406 593 784 687 817 ÷ 2 = 17 203 296 892 343 908 + 1;
  • 17 203 296 892 343 908 ÷ 2 = 8 601 648 446 171 954 + 0;
  • 8 601 648 446 171 954 ÷ 2 = 4 300 824 223 085 977 + 0;
  • 4 300 824 223 085 977 ÷ 2 = 2 150 412 111 542 988 + 1;
  • 2 150 412 111 542 988 ÷ 2 = 1 075 206 055 771 494 + 0;
  • 1 075 206 055 771 494 ÷ 2 = 537 603 027 885 747 + 0;
  • 537 603 027 885 747 ÷ 2 = 268 801 513 942 873 + 1;
  • 268 801 513 942 873 ÷ 2 = 134 400 756 971 436 + 1;
  • 134 400 756 971 436 ÷ 2 = 67 200 378 485 718 + 0;
  • 67 200 378 485 718 ÷ 2 = 33 600 189 242 859 + 0;
  • 33 600 189 242 859 ÷ 2 = 16 800 094 621 429 + 1;
  • 16 800 094 621 429 ÷ 2 = 8 400 047 310 714 + 1;
  • 8 400 047 310 714 ÷ 2 = 4 200 023 655 357 + 0;
  • 4 200 023 655 357 ÷ 2 = 2 100 011 827 678 + 1;
  • 2 100 011 827 678 ÷ 2 = 1 050 005 913 839 + 0;
  • 1 050 005 913 839 ÷ 2 = 525 002 956 919 + 1;
  • 525 002 956 919 ÷ 2 = 262 501 478 459 + 1;
  • 262 501 478 459 ÷ 2 = 131 250 739 229 + 1;
  • 131 250 739 229 ÷ 2 = 65 625 369 614 + 1;
  • 65 625 369 614 ÷ 2 = 32 812 684 807 + 0;
  • 32 812 684 807 ÷ 2 = 16 406 342 403 + 1;
  • 16 406 342 403 ÷ 2 = 8 203 171 201 + 1;
  • 8 203 171 201 ÷ 2 = 4 101 585 600 + 1;
  • 4 101 585 600 ÷ 2 = 2 050 792 800 + 0;
  • 2 050 792 800 ÷ 2 = 1 025 396 400 + 0;
  • 1 025 396 400 ÷ 2 = 512 698 200 + 0;
  • 512 698 200 ÷ 2 = 256 349 100 + 0;
  • 256 349 100 ÷ 2 = 128 174 550 + 0;
  • 128 174 550 ÷ 2 = 64 087 275 + 0;
  • 64 087 275 ÷ 2 = 32 043 637 + 1;
  • 32 043 637 ÷ 2 = 16 021 818 + 1;
  • 16 021 818 ÷ 2 = 8 010 909 + 0;
  • 8 010 909 ÷ 2 = 4 005 454 + 1;
  • 4 005 454 ÷ 2 = 2 002 727 + 0;
  • 2 002 727 ÷ 2 = 1 001 363 + 1;
  • 1 001 363 ÷ 2 = 500 681 + 1;
  • 500 681 ÷ 2 = 250 340 + 1;
  • 250 340 ÷ 2 = 125 170 + 0;
  • 125 170 ÷ 2 = 62 585 + 0;
  • 62 585 ÷ 2 = 31 292 + 1;
  • 31 292 ÷ 2 = 15 646 + 0;
  • 15 646 ÷ 2 = 7 823 + 0;
  • 7 823 ÷ 2 = 3 911 + 1;
  • 3 911 ÷ 2 = 1 955 + 1;
  • 1 955 ÷ 2 = 977 + 1;
  • 977 ÷ 2 = 488 + 1;
  • 488 ÷ 2 = 244 + 0;
  • 244 ÷ 2 = 122 + 0;
  • 122 ÷ 2 = 61 + 0;
  • 61 ÷ 2 = 30 + 1;
  • 30 ÷ 2 = 15 + 0;
  • 15 ÷ 2 = 7 + 1;
  • 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 101 011 001 110 010 169(10) = 1111 0100 0111 1001 0011 1010 1100 0000 1110 1111 0101 1001 1001 0011 1001(2)


3. Determine the signed binary number bit length:

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

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

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 101 011 001 110 010 169(10) Base 10 integer number converted and written as a signed binary code (in base 2):

1 101 011 001 110 010 169(10) = 0000 1111 0100 0111 1001 0011 1010 1100 0000 1110 1111 0101 1001 1001 0011 1001

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

» More ops: Convert 1 101 011 001 110 010 182, 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