Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,074; 200,000,000,384) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,074 = 2 × 3 × 211 × 78,989
100,000,074 is not a prime number but a composite one.
200,000,000,384 = 27 × 1,562,500,003
200,000,000,384 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,384 ÷ 100,000,074 = 1,999 + 99,852,458
Step 2. Divide the smaller number by the above operation's remainder:
100,000,074 ÷ 99,852,458 = 1 + 147,616
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,852,458 ÷ 147,616 = 676 + 64,042
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
147,616 ÷ 64,042 = 2 + 19,532
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
64,042 ÷ 19,532 = 3 + 5,446
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
19,532 ÷ 5,446 = 3 + 3,194
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,446 ÷ 3,194 = 1 + 2,252
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,194 ÷ 2,252 = 1 + 942
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,252 ÷ 942 = 2 + 368
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
942 ÷ 368 = 2 + 206
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
368 ÷ 206 = 1 + 162
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
206 ÷ 162 = 1 + 44
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
162 ÷ 44 = 3 + 30
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
44 ÷ 30 = 1 + 14
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
30 ÷ 14 = 2 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
14 ÷ 2 = 7 + 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,074; 200,000,000,384) = 2
The two numbers have common prime factors