# Signed: Integer -> Binary: 10 110 010 937 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 10 110 010 937(10)converted and written as a signed binary (base 2) = ?

### 1. Divide the number repeatedly by 2:

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

• division = quotient + remainder;
• 10 110 010 937 ÷ 2 = 5 055 005 468 + 1;
• 5 055 005 468 ÷ 2 = 2 527 502 734 + 0;
• 2 527 502 734 ÷ 2 = 1 263 751 367 + 0;
• 1 263 751 367 ÷ 2 = 631 875 683 + 1;
• 631 875 683 ÷ 2 = 315 937 841 + 1;
• 315 937 841 ÷ 2 = 157 968 920 + 1;
• 157 968 920 ÷ 2 = 78 984 460 + 0;
• 78 984 460 ÷ 2 = 39 492 230 + 0;
• 39 492 230 ÷ 2 = 19 746 115 + 0;
• 19 746 115 ÷ 2 = 9 873 057 + 1;
• 9 873 057 ÷ 2 = 4 936 528 + 1;
• 4 936 528 ÷ 2 = 2 468 264 + 0;
• 2 468 264 ÷ 2 = 1 234 132 + 0;
• 1 234 132 ÷ 2 = 617 066 + 0;
• 617 066 ÷ 2 = 308 533 + 0;
• 308 533 ÷ 2 = 154 266 + 1;
• 154 266 ÷ 2 = 77 133 + 0;
• 77 133 ÷ 2 = 38 566 + 1;
• 38 566 ÷ 2 = 19 283 + 0;
• 19 283 ÷ 2 = 9 641 + 1;
• 9 641 ÷ 2 = 4 820 + 1;
• 4 820 ÷ 2 = 2 410 + 0;
• 2 410 ÷ 2 = 1 205 + 0;
• 1 205 ÷ 2 = 602 + 1;
• 602 ÷ 2 = 301 + 0;
• 301 ÷ 2 = 150 + 1;
• 150 ÷ 2 = 75 + 0;
• 75 ÷ 2 = 37 + 1;
• 37 ÷ 2 = 18 + 1;
• 18 ÷ 2 = 9 + 0;
• 9 ÷ 2 = 4 + 1;
• 4 ÷ 2 = 2 + 0;
• 2 ÷ 2 = 1 + 0;
• 1 ÷ 2 = 0 + 1;

## 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