Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,092; 200,000,001,021) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,092 = 22 × 3 × 71 × 117,371
100,000,092 is not a prime number but a composite one.
200,000,001,021 = 3 × 37 × 2,749 × 655,439
200,000,001,021 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,001,021 ÷ 100,000,092 = 1,999 + 99,817,113
Step 2. Divide the smaller number by the above operation's remainder:
100,000,092 ÷ 99,817,113 = 1 + 182,979
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,817,113 ÷ 182,979 = 545 + 93,558
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
182,979 ÷ 93,558 = 1 + 89,421
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
93,558 ÷ 89,421 = 1 + 4,137
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
89,421 ÷ 4,137 = 21 + 2,544
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,137 ÷ 2,544 = 1 + 1,593
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,544 ÷ 1,593 = 1 + 951
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,593 ÷ 951 = 1 + 642
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
951 ÷ 642 = 1 + 309
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
642 ÷ 309 = 2 + 24
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
309 ÷ 24 = 12 + 21
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
24 ÷ 21 = 1 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
21 ÷ 3 = 7 + 0
At this step, the remainder is zero, so we stop:
3 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,092; 200,000,001,021) = 3
The two numbers have common prime factors