Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,870; 200,000,000,132) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,870 = 2 × 3 × 5 × 53 × 109 × 577
99,999,870 is not a prime number but a composite one.
200,000,000,132 = 22 × 21,943 × 2,278,631
200,000,000,132 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,132 ÷ 99,999,870 = 2,000 + 260,132
Step 2. Divide the smaller number by the above operation's remainder:
99,999,870 ÷ 260,132 = 384 + 109,182
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
260,132 ÷ 109,182 = 2 + 41,768
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
109,182 ÷ 41,768 = 2 + 25,646
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
41,768 ÷ 25,646 = 1 + 16,122
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
25,646 ÷ 16,122 = 1 + 9,524
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
16,122 ÷ 9,524 = 1 + 6,598
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
9,524 ÷ 6,598 = 1 + 2,926
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6,598 ÷ 2,926 = 2 + 746
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,926 ÷ 746 = 3 + 688
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
746 ÷ 688 = 1 + 58
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
688 ÷ 58 = 11 + 50
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
58 ÷ 50 = 1 + 8
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
50 ÷ 8 = 6 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
8 ÷ 2 = 4 + 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 (99,999,870; 200,000,000,132) = 2
The two numbers have common prime factors