Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,024; 200,000,000,438) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,024 = 23 × 12,500,003
100,000,024 is not a prime number but a composite one.
200,000,000,438 = 2 × 72 × 2,040,816,331
200,000,000,438 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,438 ÷ 100,000,024 = 1,999 + 99,952,462
Step 2. Divide the smaller number by the above operation's remainder:
100,000,024 ÷ 99,952,462 = 1 + 47,562
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,952,462 ÷ 47,562 = 2,101 + 24,700
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
47,562 ÷ 24,700 = 1 + 22,862
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
24,700 ÷ 22,862 = 1 + 1,838
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
22,862 ÷ 1,838 = 12 + 806
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,838 ÷ 806 = 2 + 226
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
806 ÷ 226 = 3 + 128
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
226 ÷ 128 = 1 + 98
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
128 ÷ 98 = 1 + 30
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
98 ÷ 30 = 3 + 8
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
30 ÷ 8 = 3 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
8 ÷ 6 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 2 = 3 + 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,024; 200,000,000,438) = 2
The two numbers have common prime factors