Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,084; 200,000,000,994) = ?
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,994 = 2 × 3 × 33,333,333,499
200,000,000,994 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,994 ÷ 100,000,084 = 1,999 + 99,833,078
Step 2. Divide the smaller number by the above operation's remainder:
100,000,084 ÷ 99,833,078 = 1 + 167,006
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,833,078 ÷ 167,006 = 597 + 130,496
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
167,006 ÷ 130,496 = 1 + 36,510
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
130,496 ÷ 36,510 = 3 + 20,966
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
36,510 ÷ 20,966 = 1 + 15,544
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
20,966 ÷ 15,544 = 1 + 5,422
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
15,544 ÷ 5,422 = 2 + 4,700
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,422 ÷ 4,700 = 1 + 722
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
4,700 ÷ 722 = 6 + 368
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
722 ÷ 368 = 1 + 354
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
368 ÷ 354 = 1 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
354 ÷ 14 = 25 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
14 ÷ 4 = 3 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
4 ÷ 2 = 2 + 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,994) = 2
The two numbers have common prime factors