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

## How to convert an unsigned (positive) integer in decimal system (in base 10): 2(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;
• 2 ÷ 2 = 1 + 0;
• 1 ÷ 2 = 0 + 1;

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

 2 = 10 Feb 27 23:51 UTC (GMT) 1 205 = 100 1011 0101 Feb 27 23:51 UTC (GMT) 809 = 11 0010 1001 Feb 27 23:51 UTC (GMT) 5 031 = 1 0011 1010 0111 Feb 27 23:50 UTC (GMT) 2 934 587 392 = 1010 1110 1110 1010 0100 0000 0000 0000 Feb 27 23:49 UTC (GMT) 2 019 = 111 1110 0011 Feb 27 23:47 UTC (GMT) 1 001 012 = 1111 0100 0110 0011 0100 Feb 27 23:47 UTC (GMT) 1 100 111 = 1 0000 1100 1001 0100 1111 Feb 27 23:47 UTC (GMT) 1 984 = 111 1100 0000 Feb 27 23:46 UTC (GMT) 1 859 = 111 0100 0011 Feb 27 23:46 UTC (GMT) 355 687 428 100 000 = 1 0100 0011 0111 1110 1110 1110 1100 1101 1000 1111 1010 0000 Feb 27 23:45 UTC (GMT) 4 535 = 1 0001 1011 0111 Feb 27 23:45 UTC (GMT) 46 = 10 1110 Feb 27 23:45 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)