Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,067; 200,000,000,554) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,067 = 23 × 47 × 92,507
100,000,067 is not a prime number but a composite one.
200,000,000,554 = 2 × 23 × 41 × 239 × 443,701
200,000,000,554 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,554 ÷ 100,000,067 = 1,999 + 99,866,621
Step 2. Divide the smaller number by the above operation's remainder:
100,000,067 ÷ 99,866,621 = 1 + 133,446
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,866,621 ÷ 133,446 = 748 + 49,013
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
133,446 ÷ 49,013 = 2 + 35,420
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
49,013 ÷ 35,420 = 1 + 13,593
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
35,420 ÷ 13,593 = 2 + 8,234
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
13,593 ÷ 8,234 = 1 + 5,359
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,234 ÷ 5,359 = 1 + 2,875
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,359 ÷ 2,875 = 1 + 2,484
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,875 ÷ 2,484 = 1 + 391
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
2,484 ÷ 391 = 6 + 138
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
391 ÷ 138 = 2 + 115
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
138 ÷ 115 = 1 + 23
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
115 ÷ 23 = 5 + 0
At this step, the remainder is zero, so we stop:
23 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,067; 200,000,000,554) = 23
The two numbers have common prime factors