Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,084; 200,000,000,334) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,084 = 22 × 271 × 92,251
100,000,084 is not a prime number but a composite one.
200,000,000,334 = 2 × 3 × 17 × 31 × 63,251,107
200,000,000,334 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,334 ÷ 100,000,084 = 1,999 + 99,832,418
Step 2. Divide the smaller number by the above operation's remainder:
100,000,084 ÷ 99,832,418 = 1 + 167,666
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,832,418 ÷ 167,666 = 595 + 71,148
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
167,666 ÷ 71,148 = 2 + 25,370
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
71,148 ÷ 25,370 = 2 + 20,408
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
25,370 ÷ 20,408 = 1 + 4,962
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
20,408 ÷ 4,962 = 4 + 560
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,962 ÷ 560 = 8 + 482
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
560 ÷ 482 = 1 + 78
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
482 ÷ 78 = 6 + 14
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
78 ÷ 14 = 5 + 8
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
14 ÷ 8 = 1 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
8 ÷ 6 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,084; 200,000,000,334) = 2
The two numbers have common prime factors