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

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

 47 = 10 1111 Sep 19 02:16 UTC (GMT) 380 = 1 0111 1100 Sep 19 02:14 UTC (GMT) 48 121 = 1011 1011 1111 1001 Sep 19 02:11 UTC (GMT) 157 = 1001 1101 Sep 19 02:11 UTC (GMT) 67 = 100 0011 Sep 19 02:10 UTC (GMT) 1 030 = 100 0000 0110 Sep 19 02:10 UTC (GMT) 84 = 101 0100 Sep 19 02:07 UTC (GMT) 7 450 = 1 1101 0001 1010 Sep 19 02:05 UTC (GMT) 20 = 1 0100 Sep 19 02:05 UTC (GMT) 17 = 1 0001 Sep 19 02:03 UTC (GMT) 10 000 = 10 0111 0001 0000 Sep 19 02:03 UTC (GMT) 432 = 1 1011 0000 Sep 19 02:02 UTC (GMT) 5 = 101 Sep 19 02:02 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)