Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,102; 200,000,000,490) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,102 = 2 × 6,367 × 7,853
100,000,102 is not a prime number but a composite one.
200,000,000,490 = 2 × 3 × 5 × 761 × 8,760,403
200,000,000,490 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,490 ÷ 100,000,102 = 1,999 + 99,796,592
Step 2. Divide the smaller number by the above operation's remainder:
100,000,102 ÷ 99,796,592 = 1 + 203,510
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,796,592 ÷ 203,510 = 490 + 76,692
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
203,510 ÷ 76,692 = 2 + 50,126
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
76,692 ÷ 50,126 = 1 + 26,566
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
50,126 ÷ 26,566 = 1 + 23,560
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
26,566 ÷ 23,560 = 1 + 3,006
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
23,560 ÷ 3,006 = 7 + 2,518
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,006 ÷ 2,518 = 1 + 488
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,518 ÷ 488 = 5 + 78
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
488 ÷ 78 = 6 + 20
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
78 ÷ 20 = 3 + 18
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
20 ÷ 18 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
18 ÷ 2 = 9 + 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,102; 200,000,000,490) = 2
The two numbers have common prime factors