Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,098; 200,000,000,910) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,098 = 2 × 32 × 11 × 505,051
100,000,098 is not a prime number but a composite one.
200,000,000,910 = 2 × 3 × 5 × 37 × 331 × 683 × 797
200,000,000,910 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,910 ÷ 100,000,098 = 1,999 + 99,805,008
Step 2. Divide the smaller number by the above operation's remainder:
100,000,098 ÷ 99,805,008 = 1 + 195,090
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,805,008 ÷ 195,090 = 511 + 114,018
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
195,090 ÷ 114,018 = 1 + 81,072
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
114,018 ÷ 81,072 = 1 + 32,946
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
81,072 ÷ 32,946 = 2 + 15,180
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
32,946 ÷ 15,180 = 2 + 2,586
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
15,180 ÷ 2,586 = 5 + 2,250
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,586 ÷ 2,250 = 1 + 336
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,250 ÷ 336 = 6 + 234
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
336 ÷ 234 = 1 + 102
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
234 ÷ 102 = 2 + 30
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
102 ÷ 30 = 3 + 12
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
30 ÷ 12 = 2 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
12 ÷ 6 = 2 + 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,098; 200,000,000,910) = 6 = 2 × 3
The two numbers have common prime factors