Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,124; 200,000,000,266) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,124 = 22 × 7 × 3,571,433
100,000,124 is not a prime number but a composite one.
200,000,000,266 = 2 × 11 × 17 × 534,759,359
200,000,000,266 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,266 ÷ 100,000,124 = 1,999 + 99,752,390
Step 2. Divide the smaller number by the above operation's remainder:
100,000,124 ÷ 99,752,390 = 1 + 247,734
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,752,390 ÷ 247,734 = 402 + 163,322
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
247,734 ÷ 163,322 = 1 + 84,412
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
163,322 ÷ 84,412 = 1 + 78,910
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
84,412 ÷ 78,910 = 1 + 5,502
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
78,910 ÷ 5,502 = 14 + 1,882
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,502 ÷ 1,882 = 2 + 1,738
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,882 ÷ 1,738 = 1 + 144
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,738 ÷ 144 = 12 + 10
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
144 ÷ 10 = 14 + 4
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
10 ÷ 4 = 2 + 2
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
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,124; 200,000,000,266) = 2
The two numbers have common prime factors