Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,076; 200,000,000,642) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,076 = 22 × 11 × 2,272,729
100,000,076 is not a prime number but a composite one.
200,000,000,642 = 2 × 13 × 467 × 1,193 × 13,807
200,000,000,642 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,642 ÷ 100,000,076 = 1,999 + 99,848,718
Step 2. Divide the smaller number by the above operation's remainder:
100,000,076 ÷ 99,848,718 = 1 + 151,358
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,848,718 ÷ 151,358 = 659 + 103,796
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
151,358 ÷ 103,796 = 1 + 47,562
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
103,796 ÷ 47,562 = 2 + 8,672
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
47,562 ÷ 8,672 = 5 + 4,202
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
8,672 ÷ 4,202 = 2 + 268
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,202 ÷ 268 = 15 + 182
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
268 ÷ 182 = 1 + 86
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
182 ÷ 86 = 2 + 10
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
86 ÷ 10 = 8 + 6
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
10 ÷ 6 = 1 + 4
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
6 ÷ 4 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,076; 200,000,000,642) = 2
The two numbers have common prime factors