Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,024; 200,000,000,572) = ?
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,572 = 22 × 17 × 43 × 97 × 463 × 1,523
200,000,000,572 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,572 ÷ 100,000,024 = 1,999 + 99,952,596
Step 2. Divide the smaller number by the above operation's remainder:
100,000,024 ÷ 99,952,596 = 1 + 47,428
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,952,596 ÷ 47,428 = 2,107 + 21,800
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
47,428 ÷ 21,800 = 2 + 3,828
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
21,800 ÷ 3,828 = 5 + 2,660
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
3,828 ÷ 2,660 = 1 + 1,168
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,660 ÷ 1,168 = 2 + 324
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,168 ÷ 324 = 3 + 196
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
324 ÷ 196 = 1 + 128
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
196 ÷ 128 = 1 + 68
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
128 ÷ 68 = 1 + 60
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
68 ÷ 60 = 1 + 8
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
60 ÷ 8 = 7 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
8 ÷ 4 = 2 + 0
At this step, the remainder is zero, so we stop:
4 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,572) = 4 = 22
The two numbers have common prime factors