# Are the Two Numbers 100,100,068 and 1,000,936 Relatively Prime (Coprime, Prime to Each Other)? Online Calculator

## Are the numbers 100,100,068 and 1,000,936 coprime (prime to each other, relatively prime)? The relationship to their greatest common factor

### 100,100,068 and 1,000,936 are not relatively prime... if:

#### If there is at least one number other than 1 that evenly divides the two numbers (without a remainder). Or...

#### Or, in other words, if their greatest (highest) common factor (divisor), gcf (hcf, gcd), is not equal to 1.

## Calculate the greatest (highest) common factor (divisor),

gcf (hcf, gcd), of the two numbers

### Method 1. The prime factorization:

#### The prime factorization of a number: finding the prime numbers that multiply together to make that number.

#### 100,100,068 = 2^{2} × 281 × 89,057

100,100,068 is not a prime number, is a composite one.

#### 1,000,936 = 2^{3} × 125,117

1,000,936 is not a prime number, is a composite one.

#### Prime number: a number that is divisible (dividing evenly) only by 1 and itself. A prime number has only two factors: 1 and itself.

#### Composite number: a natural number that has at least one other factor than 1 and itself.

### Calculate the greatest (highest) common factor (divisor), gcf (hcf, gcd):

#### Multiply all the common prime factors of the two numbers, taken by their smallest exponents (powers).

### gcf (hcf, gcd) (100,100,068; 1,000,936) = 2^{2} = 4 ≠ 1

## Coprime numbers (prime to each other, relatively prime) (100,100,068; 1,000,936)? No.

The two numbers have common prime factors.

gcf (hcf, gcd) (1,000,936; 100,100,068) = 4 ≠ 1

Scroll down for the 2nd method...

### Method 2. The Euclidean Algorithm:

#### This algorithm involves the process of dividing numbers and calculating the remainders.

#### 'a' and 'b' are the two natural numbers, 'a' >= 'b'.

#### Divide 'a' by 'b' and get the remainder of the operation, 'r'.

#### If 'r' = 0, STOP. 'b' = the gcf (hcf, gcd) of 'a' and 'b'.

#### Else: Replace ('a' by 'b') and ('b' by 'r'). Return to the step above.

#### Step 1. Divide the larger number by the smaller one:

100,100,068 ÷ 1,000,936 = 100 + 6,468

Step 2. Divide the smaller number by the above operation's remainder:

1,000,936 ÷ 6,468 = 154 + 4,864

Step 3. Divide the remainder of the step 1 by the remainder of the step 2:

6,468 ÷ 4,864 = 1 + 1,604

Step 4. Divide the remainder of the step 2 by the remainder of the step 3:

4,864 ÷ 1,604 = 3 + 52

Step 5. Divide the remainder of the step 3 by the remainder of the step 4:

1,604 ÷ 52 = 30 + 44

Step 6. Divide the remainder of the step 4 by the remainder of the step 5:

52 ÷ 44 = 1 + 8

Step 7. Divide the remainder of the step 5 by the remainder of the step 6:

44 ÷ 8 = 5 + 4

Step 8. Divide the remainder of the step 6 by the remainder of the step 7:

8 ÷ 4 = 2 + 0

At this step, the remainder is zero, so we stop:

4 is the number we were looking for - the last non-zero remainder.

This is the greatest (highest) common factor (divisor).

### gcf (hcf, gcd) (100,100,068; 1,000,936) = 4 ≠ 1

## Coprime numbers (prime to each other, relatively prime) (100,100,068; 1,000,936)? No.

gcf (hcf, gcd) (1,000,936; 100,100,068) = 4 ≠ 1

### Other similar operations with coprime numbers: