# Base ten decimal system unsigned (positive) integer number 56 converted to unsigned binary (base two)

## How to convert an unsigned (positive) integer in decimal system (in base 10): 56(10) to an unsigned binary (base 2)

### 1. Divide the number repeatedly by 2, keeping track of each remainder, until we get a quotient that is equal to zero:

• division = quotient + remainder;
• 56 ÷ 2 = 28 + 0;
• 28 ÷ 2 = 14 + 0;
• 14 ÷ 2 = 7 + 0;
• 7 ÷ 2 = 3 + 1;
• 3 ÷ 2 = 1 + 1;
• 1 ÷ 2 = 0 + 1;

## Latest positive integer numbers (unsigned) converted from decimal (base ten) to unsigned binary (base two)

 56 = 11 1000 Oct 16 19:44 UTC (GMT) 11 = 1011 Oct 16 19:42 UTC (GMT) 2 147 483 629 = 111 1111 1111 1111 1111 1111 1110 1101 Oct 16 19:42 UTC (GMT) 3 556 666 = 11 0110 0100 0101 0011 1010 Oct 16 19:40 UTC (GMT) 150 = 1001 0110 Oct 16 19:39 UTC (GMT) 2 516 = 1001 1101 0100 Oct 16 19:39 UTC (GMT) 192 = 1100 0000 Oct 16 19:38 UTC (GMT) 1 992 = 111 1100 1000 Oct 16 19:38 UTC (GMT) 39 661 568 = 10 0101 1101 0011 0000 0000 0000 Oct 16 19:37 UTC (GMT) 3 369 = 1101 0010 1001 Oct 16 19:37 UTC (GMT) 80 = 101 0000 Oct 16 19:37 UTC (GMT) 112 = 111 0000 Oct 16 19:37 UTC (GMT) 500 = 1 1111 0100 Oct 16 19:36 UTC (GMT) All decimal positive integers converted to unsigned binary (base 2)

## How to convert unsigned integer numbers (positive) from decimal system (base 10) to binary = simply convert from base ten to base two

### Follow the steps below to convert a base ten unsigned integer number to base two:

• 1. Divide repeatedly by 2 the positive integer number that has to be converted to binary, keeping track of each remainder, until we get a QUOTIENT that is equal to ZERO.
• 2. Construct the base 2 representation of the positive integer 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).

### Example: convert the positive integer number 55 from decimal system (base ten) to binary code (base two):

• 1. Divide repeatedly 55 by 2, keeping track of each remainder, until we get a quotient that is equal to zero:
• division = quotient + remainder;
• 55 ÷ 2 = 27 + 1;
• 27 ÷ 2 = 13 + 1;
• 13 ÷ 2 = 6 + 1;
• 6 ÷ 2 = 3 + 0;
• 3 ÷ 2 = 1 + 1;
• 1 ÷ 2 = 0 + 1;
• 2. Construct the base 2 representation of the positive integer number, by taking all the remainders starting from the bottom of the list constructed above:
55(10) = 11 0111(2)