# Converter to unsigned binary system (base two): converting decimal system (base ten) unsigned (positive) integer numbers

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

 6 204 = 1 1000 0011 1100 May 24 14:50 UTC (GMT) 448 = 1 1100 0000 May 24 14:50 UTC (GMT) 103 = 110 0111 May 24 14:47 UTC (GMT) 55 = 11 0111 May 24 14:46 UTC (GMT) 1 323 = 101 0010 1011 May 24 14:46 UTC (GMT) 4 628 = 1 0010 0001 0100 May 24 14:45 UTC (GMT) 12 343 832 = 1011 1100 0101 1010 0001 1000 May 24 14:43 UTC (GMT) 8 252 = 10 0000 0011 1100 May 24 14:43 UTC (GMT) 1 986 = 111 1100 0010 May 24 14:38 UTC (GMT) 26 760 000 000 = 110 0011 1011 0000 0101 0011 0010 0000 0000 May 24 14:35 UTC (GMT) 2 549 = 1001 1111 0101 May 24 14:34 UTC (GMT) 12 375 = 11 0000 0101 0111 May 24 14:33 UTC (GMT) 838 992 641 = 11 0010 0000 0010 0000 0011 0000 0001 May 24 14:25 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)