# Unsigned: Integer -> Binary: 744 658 717 Convert the Positive Integer (Whole Number) From Base Ten (10) To Base Two (2), Conversion and Writing of Decimal System Number as Unsigned Binary Code

## Unsigned (positive) integer number 744 658 717(10) converted and written as an unsigned binary (base 2) = ?

### 1. Divide the number repeatedly by 2:

#### We stop when we get a quotient that is equal to zero.

• division = quotient + remainder;
• 744 658 717 ÷ 2 = 372 329 358 + 1;
• 372 329 358 ÷ 2 = 186 164 679 + 0;
• 186 164 679 ÷ 2 = 93 082 339 + 1;
• 93 082 339 ÷ 2 = 46 541 169 + 1;
• 46 541 169 ÷ 2 = 23 270 584 + 1;
• 23 270 584 ÷ 2 = 11 635 292 + 0;
• 11 635 292 ÷ 2 = 5 817 646 + 0;
• 5 817 646 ÷ 2 = 2 908 823 + 0;
• 2 908 823 ÷ 2 = 1 454 411 + 1;
• 1 454 411 ÷ 2 = 727 205 + 1;
• 727 205 ÷ 2 = 363 602 + 1;
• 363 602 ÷ 2 = 181 801 + 0;
• 181 801 ÷ 2 = 90 900 + 1;
• 90 900 ÷ 2 = 45 450 + 0;
• 45 450 ÷ 2 = 22 725 + 0;
• 22 725 ÷ 2 = 11 362 + 1;
• 11 362 ÷ 2 = 5 681 + 0;
• 5 681 ÷ 2 = 2 840 + 1;
• 2 840 ÷ 2 = 1 420 + 0;
• 1 420 ÷ 2 = 710 + 0;
• 710 ÷ 2 = 355 + 0;
• 355 ÷ 2 = 177 + 1;
• 177 ÷ 2 = 88 + 1;
• 88 ÷ 2 = 44 + 0;
• 44 ÷ 2 = 22 + 0;
• 22 ÷ 2 = 11 + 0;
• 11 ÷ 2 = 5 + 1;
• 5 ÷ 2 = 2 + 1;
• 2 ÷ 2 = 1 + 0;
• 1 ÷ 2 = 0 + 1;

## 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)