Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,072; 200,000,000,364) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,072 = 23 × 73 × 171,233
100,000,072 is not a prime number but a composite one.
200,000,000,364 = 22 × 3 × 16,666,666,697
200,000,000,364 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,364 ÷ 100,000,072 = 1,999 + 99,856,436
Step 2. Divide the smaller number by the above operation's remainder:
100,000,072 ÷ 99,856,436 = 1 + 143,636
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,856,436 ÷ 143,636 = 695 + 29,416
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
143,636 ÷ 29,416 = 4 + 25,972
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
29,416 ÷ 25,972 = 1 + 3,444
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
25,972 ÷ 3,444 = 7 + 1,864
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,444 ÷ 1,864 = 1 + 1,580
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,864 ÷ 1,580 = 1 + 284
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,580 ÷ 284 = 5 + 160
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
284 ÷ 160 = 1 + 124
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
160 ÷ 124 = 1 + 36
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
124 ÷ 36 = 3 + 16
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
36 ÷ 16 = 2 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
16 ÷ 4 = 4 + 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,072; 200,000,000,364) = 4 = 22
The two numbers have common prime factors