Convert 11 101 001 010 328 to a Signed Binary (Base 2)

How to convert 11 101 001 010 328(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 11 101 001 010 328 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;
  • 11 101 001 010 328 ÷ 2 = 5 550 500 505 164 + 0;
  • 5 550 500 505 164 ÷ 2 = 2 775 250 252 582 + 0;
  • 2 775 250 252 582 ÷ 2 = 1 387 625 126 291 + 0;
  • 1 387 625 126 291 ÷ 2 = 693 812 563 145 + 1;
  • 693 812 563 145 ÷ 2 = 346 906 281 572 + 1;
  • 346 906 281 572 ÷ 2 = 173 453 140 786 + 0;
  • 173 453 140 786 ÷ 2 = 86 726 570 393 + 0;
  • 86 726 570 393 ÷ 2 = 43 363 285 196 + 1;
  • 43 363 285 196 ÷ 2 = 21 681 642 598 + 0;
  • 21 681 642 598 ÷ 2 = 10 840 821 299 + 0;
  • 10 840 821 299 ÷ 2 = 5 420 410 649 + 1;
  • 5 420 410 649 ÷ 2 = 2 710 205 324 + 1;
  • 2 710 205 324 ÷ 2 = 1 355 102 662 + 0;
  • 1 355 102 662 ÷ 2 = 677 551 331 + 0;
  • 677 551 331 ÷ 2 = 338 775 665 + 1;
  • 338 775 665 ÷ 2 = 169 387 832 + 1;
  • 169 387 832 ÷ 2 = 84 693 916 + 0;
  • 84 693 916 ÷ 2 = 42 346 958 + 0;
  • 42 346 958 ÷ 2 = 21 173 479 + 0;
  • 21 173 479 ÷ 2 = 10 586 739 + 1;
  • 10 586 739 ÷ 2 = 5 293 369 + 1;
  • 5 293 369 ÷ 2 = 2 646 684 + 1;
  • 2 646 684 ÷ 2 = 1 323 342 + 0;
  • 1 323 342 ÷ 2 = 661 671 + 0;
  • 661 671 ÷ 2 = 330 835 + 1;
  • 330 835 ÷ 2 = 165 417 + 1;
  • 165 417 ÷ 2 = 82 708 + 1;
  • 82 708 ÷ 2 = 41 354 + 0;
  • 41 354 ÷ 2 = 20 677 + 0;
  • 20 677 ÷ 2 = 10 338 + 1;
  • 10 338 ÷ 2 = 5 169 + 0;
  • 5 169 ÷ 2 = 2 584 + 1;
  • 2 584 ÷ 2 = 1 292 + 0;
  • 1 292 ÷ 2 = 646 + 0;
  • 646 ÷ 2 = 323 + 0;
  • 323 ÷ 2 = 161 + 1;
  • 161 ÷ 2 = 80 + 1;
  • 80 ÷ 2 = 40 + 0;
  • 40 ÷ 2 = 20 + 0;
  • 20 ÷ 2 = 10 + 0;
  • 10 ÷ 2 = 5 + 0;
  • 5 ÷ 2 = 2 + 1;
  • 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.

11 101 001 010 328(10) = 1010 0001 1000 1010 0111 0011 1000 1100 1100 1001 1000(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:


11 101 001 010 328(10) Base 10 integer number converted and written as a signed binary code (in base 2):

11 101 001 010 328(10) = 0000 0000 0000 0000 0000 1010 0001 1000 1010 0111 0011 1000 1100 1100 1001 1000

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

Share

» More ops: Convert 11 101 001 010 369, 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 09, 2026 [September]: Signed base 10 integer numbers converted and written as signed binary code. Calculations performed during the month of: September - by our visitors

» Improve your social skills: Show, Don’t Tell, the Strategic Power of Action. Gemini Notebook YouTube Video of 9.21 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