Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,098; 200,000,000,984) = ?
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,984 = 23 × 7 × 37 × 191 × 505,367
200,000,000,984 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,984 ÷ 100,000,098 = 1,999 + 99,805,082
Step 2. Divide the smaller number by the above operation's remainder:
100,000,098 ÷ 99,805,082 = 1 + 195,016
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,805,082 ÷ 195,016 = 511 + 151,906
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
195,016 ÷ 151,906 = 1 + 43,110
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
151,906 ÷ 43,110 = 3 + 22,576
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
43,110 ÷ 22,576 = 1 + 20,534
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
22,576 ÷ 20,534 = 1 + 2,042
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
20,534 ÷ 2,042 = 10 + 114
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,042 ÷ 114 = 17 + 104
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
114 ÷ 104 = 1 + 10
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
104 ÷ 10 = 10 + 4
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
10 ÷ 4 = 2 + 2
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
4 ÷ 2 = 2 + 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,098; 200,000,000,984) = 2
The two numbers have common prime factors