Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,239; 200,000,000,127) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,239 = 3 × 17 × 1,960,789
100,000,239 is not a prime number but a composite one.
200,000,000,127 = 3 × 66,666,666,709
200,000,000,127 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,127 ÷ 100,000,239 = 1,999 + 99,522,366
Step 2. Divide the smaller number by the above operation's remainder:
100,000,239 ÷ 99,522,366 = 1 + 477,873
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,522,366 ÷ 477,873 = 208 + 124,782
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
477,873 ÷ 124,782 = 3 + 103,527
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
124,782 ÷ 103,527 = 1 + 21,255
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
103,527 ÷ 21,255 = 4 + 18,507
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
21,255 ÷ 18,507 = 1 + 2,748
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
18,507 ÷ 2,748 = 6 + 2,019
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,748 ÷ 2,019 = 1 + 729
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,019 ÷ 729 = 2 + 561
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
729 ÷ 561 = 1 + 168
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
561 ÷ 168 = 3 + 57
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
168 ÷ 57 = 2 + 54
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
57 ÷ 54 = 1 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
54 ÷ 3 = 18 + 0
At this step, the remainder is zero, so we stop:
3 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,239; 200,000,000,127) = 3
The two numbers have common prime factors