Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,270; 200,000,001,372) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,270 = 2 × 5 × 37 × 270,271
100,000,270 is not a prime number but a composite one.
200,000,001,372 = 22 × 3 × 16,666,666,781
200,000,001,372 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,372 ÷ 100,000,270 = 1,999 + 99,461,642
Step 2. Divide the smaller number by the above operation's remainder:
100,000,270 ÷ 99,461,642 = 1 + 538,628
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,461,642 ÷ 538,628 = 184 + 354,090
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
538,628 ÷ 354,090 = 1 + 184,538
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
354,090 ÷ 184,538 = 1 + 169,552
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
184,538 ÷ 169,552 = 1 + 14,986
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
169,552 ÷ 14,986 = 11 + 4,706
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
14,986 ÷ 4,706 = 3 + 868
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,706 ÷ 868 = 5 + 366
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
868 ÷ 366 = 2 + 136
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
366 ÷ 136 = 2 + 94
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
136 ÷ 94 = 1 + 42
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
94 ÷ 42 = 2 + 10
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
42 ÷ 10 = 4 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
10 ÷ 2 = 5 + 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,270; 200,000,001,372) = 2
The two numbers have common prime factors