Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,126; 200,000,000,480) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,126 = 2 × 50,000,063
100,000,126 is not a prime number but a composite one.
200,000,000,480 = 25 × 5 × 7 × 83 × 2,151,463
200,000,000,480 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,480 ÷ 100,000,126 = 1,999 + 99,748,606
Step 2. Divide the smaller number by the above operation's remainder:
100,000,126 ÷ 99,748,606 = 1 + 251,520
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,748,606 ÷ 251,520 = 396 + 146,686
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
251,520 ÷ 146,686 = 1 + 104,834
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
146,686 ÷ 104,834 = 1 + 41,852
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
104,834 ÷ 41,852 = 2 + 21,130
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
41,852 ÷ 21,130 = 1 + 20,722
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
21,130 ÷ 20,722 = 1 + 408
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
20,722 ÷ 408 = 50 + 322
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
408 ÷ 322 = 1 + 86
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
322 ÷ 86 = 3 + 64
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
86 ÷ 64 = 1 + 22
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
64 ÷ 22 = 2 + 20
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
22 ÷ 20 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
20 ÷ 2 = 10 + 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,126; 200,000,000,480) = 2
The two numbers have common prime factors