Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,084; 200,000,000,970) = ?
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,970 = 2 × 32 × 5 × 7 × 112 × 2,623,639
200,000,000,970 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,970 ÷ 100,000,084 = 1,999 + 99,833,054
Step 2. Divide the smaller number by the above operation's remainder:
100,000,084 ÷ 99,833,054 = 1 + 167,030
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,833,054 ÷ 167,030 = 597 + 116,144
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
167,030 ÷ 116,144 = 1 + 50,886
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
116,144 ÷ 50,886 = 2 + 14,372
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
50,886 ÷ 14,372 = 3 + 7,770
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
14,372 ÷ 7,770 = 1 + 6,602
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,770 ÷ 6,602 = 1 + 1,168
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6,602 ÷ 1,168 = 5 + 762
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,168 ÷ 762 = 1 + 406
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
762 ÷ 406 = 1 + 356
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
406 ÷ 356 = 1 + 50
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
356 ÷ 50 = 7 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
50 ÷ 6 = 8 + 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,084; 200,000,000,970) = 2
The two numbers have common prime factors