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

## How to convert an unsigned (positive) integer in decimal system (in base 10): 5 432(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;
• 5 432 ÷ 2 = 2 716 + 0;
• 2 716 ÷ 2 = 1 358 + 0;
• 1 358 ÷ 2 = 679 + 0;
• 679 ÷ 2 = 339 + 1;
• 339 ÷ 2 = 169 + 1;
• 169 ÷ 2 = 84 + 1;
• 84 ÷ 2 = 42 + 0;
• 42 ÷ 2 = 21 + 0;
• 21 ÷ 2 = 10 + 1;
• 10 ÷ 2 = 5 + 0;
• 5 ÷ 2 = 2 + 1;
• 2 ÷ 2 = 1 + 0;
• 1 ÷ 2 = 0 + 1;

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

 5 432 = 1 0101 0011 1000 Dec 13 09:03 UTC (GMT) 549 = 10 0010 0101 Dec 13 09:02 UTC (GMT) 187 = 1011 1011 Dec 13 09:02 UTC (GMT) 38 = 10 0110 Dec 13 09:02 UTC (GMT) 13 567 = 11 0100 1111 1111 Dec 13 09:00 UTC (GMT) 41 400 000 = 10 0111 0111 1011 0110 1100 0000 Dec 13 09:00 UTC (GMT) 527 = 10 0000 1111 Dec 13 08:59 UTC (GMT) 1 010 011 110 111 100 = 11 1001 0110 1001 1001 1000 1001 0110 1111 1111 0111 0111 1100 Dec 13 08:58 UTC (GMT) 9 = 1001 Dec 13 08:57 UTC (GMT) 3 841 = 1111 0000 0001 Dec 13 08:57 UTC (GMT) 283 = 1 0001 1011 Dec 13 08:57 UTC (GMT) 1 930 = 111 1000 1010 Dec 13 08:56 UTC (GMT) 728 822 015 = 10 1011 0111 0000 1111 0000 1111 1111 Dec 13 08:56 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)