Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,068; 200,000,000,642) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,068 = 22 × 3 × 7 × 1,190,477
100,000,068 is not a prime number but a composite one.
200,000,000,642 = 2 × 13 × 467 × 1,193 × 13,807
200,000,000,642 is not a prime number but a composite one.
- Prime number: a natural number that is only divisible by 1 and itself. A prime number has exactly 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):
Multiply all the common prime factors, taken by their smallest exponents (the smallest powers).
Step 1. Divide the larger number by the smaller one:
200,000,000,642 ÷ 100,000,068 = 1,999 + 99,864,710
Step 2. Divide the smaller number by the above operation's remainder:
100,000,068 ÷ 99,864,710 = 1 + 135,358
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,864,710 ÷ 135,358 = 737 + 105,864
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
135,358 ÷ 105,864 = 1 + 29,494
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
105,864 ÷ 29,494 = 3 + 17,382
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
29,494 ÷ 17,382 = 1 + 12,112
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
17,382 ÷ 12,112 = 1 + 5,270
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
12,112 ÷ 5,270 = 2 + 1,572
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,270 ÷ 1,572 = 3 + 554
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,572 ÷ 554 = 2 + 464
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
554 ÷ 464 = 1 + 90
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
464 ÷ 90 = 5 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
90 ÷ 14 = 6 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
14 ÷ 6 = 2 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 2 = 3 + 0
At this step, the remainder is zero, so we stop:
2 is the number we were looking for - the last non-zero remainder.
This is the greatest (highest) common factor (divisor).
The greatest (highest) common factor (divisor):
gcf, hcf, gcd (100,000,068; 200,000,000,642) = 2
The two numbers have common prime factors