Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,218; 200,000,001,462) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,218 = 2 × 3 × 73 × 228,311
100,000,218 is not a prime number but a composite one.
200,000,001,462 = 2 × 3 × 163 × 204,498,979
200,000,001,462 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,462 ÷ 100,000,218 = 1,999 + 99,565,680
Step 2. Divide the smaller number by the above operation's remainder:
100,000,218 ÷ 99,565,680 = 1 + 434,538
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,565,680 ÷ 434,538 = 229 + 56,478
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
434,538 ÷ 56,478 = 7 + 39,192
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
56,478 ÷ 39,192 = 1 + 17,286
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
39,192 ÷ 17,286 = 2 + 4,620
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
17,286 ÷ 4,620 = 3 + 3,426
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,620 ÷ 3,426 = 1 + 1,194
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,426 ÷ 1,194 = 2 + 1,038
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,194 ÷ 1,038 = 1 + 156
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,038 ÷ 156 = 6 + 102
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
156 ÷ 102 = 1 + 54
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
102 ÷ 54 = 1 + 48
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
54 ÷ 48 = 1 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
48 ÷ 6 = 8 + 0
At this step, the remainder is zero, so we stop:
6 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,218; 200,000,001,462) = 6 = 2 × 3
The two numbers have common prime factors