Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,080; 200,000,000,217) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,080 = 24 × 32 × 5 × 138,889
100,000,080 is not a prime number but a composite one.
200,000,000,217 = 3 × 201,581 × 330,719
200,000,000,217 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,217 ÷ 100,000,080 = 1,999 + 99,840,297
Step 2. Divide the smaller number by the above operation's remainder:
100,000,080 ÷ 99,840,297 = 1 + 159,783
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,840,297 ÷ 159,783 = 624 + 135,705
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
159,783 ÷ 135,705 = 1 + 24,078
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
135,705 ÷ 24,078 = 5 + 15,315
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
24,078 ÷ 15,315 = 1 + 8,763
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
15,315 ÷ 8,763 = 1 + 6,552
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,763 ÷ 6,552 = 1 + 2,211
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6,552 ÷ 2,211 = 2 + 2,130
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,211 ÷ 2,130 = 1 + 81
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
2,130 ÷ 81 = 26 + 24
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
81 ÷ 24 = 3 + 9
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
24 ÷ 9 = 2 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
9 ÷ 6 = 1 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 3 = 2 + 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,080; 200,000,000,217) = 3
The two numbers have common prime factors