Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,022; 200,000,000,572) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,022 = 2 × 103 × 485,437
100,000,022 is not a prime number but a composite one.
200,000,000,572 = 22 × 17 × 43 × 97 × 463 × 1,523
200,000,000,572 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,572 ÷ 100,000,022 = 1,999 + 99,956,594
Step 2. Divide the smaller number by the above operation's remainder:
100,000,022 ÷ 99,956,594 = 1 + 43,428
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,956,594 ÷ 43,428 = 2,301 + 28,766
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
43,428 ÷ 28,766 = 1 + 14,662
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
28,766 ÷ 14,662 = 1 + 14,104
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
14,662 ÷ 14,104 = 1 + 558
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
14,104 ÷ 558 = 25 + 154
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
558 ÷ 154 = 3 + 96
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
154 ÷ 96 = 1 + 58
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
96 ÷ 58 = 1 + 38
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
58 ÷ 38 = 1 + 20
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
38 ÷ 20 = 1 + 18
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
20 ÷ 18 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
18 ÷ 2 = 9 + 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,022; 200,000,000,572) = 2
The two numbers have common prime factors