Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,098; 200,000,000,462) = ?
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,462 = 2 × 23 × 15,161 × 286,777
200,000,000,462 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,462 ÷ 100,000,098 = 1,999 + 99,804,560
Step 2. Divide the smaller number by the above operation's remainder:
100,000,098 ÷ 99,804,560 = 1 + 195,538
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,804,560 ÷ 195,538 = 510 + 80,180
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
195,538 ÷ 80,180 = 2 + 35,178
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
80,180 ÷ 35,178 = 2 + 9,824
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
35,178 ÷ 9,824 = 3 + 5,706
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,824 ÷ 5,706 = 1 + 4,118
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,706 ÷ 4,118 = 1 + 1,588
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,118 ÷ 1,588 = 2 + 942
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,588 ÷ 942 = 1 + 646
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
942 ÷ 646 = 1 + 296
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
646 ÷ 296 = 2 + 54
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
296 ÷ 54 = 5 + 26
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
54 ÷ 26 = 2 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
26 ÷ 2 = 13 + 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,462) = 2
The two numbers have common prime factors