Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,098; 200,000,000,848) = ?
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,848 = 24 × 587 × 21,294,719
200,000,000,848 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,848 ÷ 100,000,098 = 1,999 + 99,804,946
Step 2. Divide the smaller number by the above operation's remainder:
100,000,098 ÷ 99,804,946 = 1 + 195,152
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,804,946 ÷ 195,152 = 511 + 82,274
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
195,152 ÷ 82,274 = 2 + 30,604
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
82,274 ÷ 30,604 = 2 + 21,066
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
30,604 ÷ 21,066 = 1 + 9,538
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
21,066 ÷ 9,538 = 2 + 1,990
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
9,538 ÷ 1,990 = 4 + 1,578
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,990 ÷ 1,578 = 1 + 412
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,578 ÷ 412 = 3 + 342
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
412 ÷ 342 = 1 + 70
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
342 ÷ 70 = 4 + 62
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
70 ÷ 62 = 1 + 8
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
62 ÷ 8 = 7 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
8 ÷ 6 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 2 = 3 + 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,848) = 2
The two numbers have common prime factors