Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,048; 200,000,000,372) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,048 = 24 × 31 × 37 × 5,449
100,000,048 is not a prime number but a composite one.
200,000,000,372 = 22 × 74,159 × 674,227
200,000,000,372 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,372 ÷ 100,000,048 = 1,999 + 99,904,420
Step 2. Divide the smaller number by the above operation's remainder:
100,000,048 ÷ 99,904,420 = 1 + 95,628
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,904,420 ÷ 95,628 = 1,044 + 68,788
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
95,628 ÷ 68,788 = 1 + 26,840
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
68,788 ÷ 26,840 = 2 + 15,108
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
26,840 ÷ 15,108 = 1 + 11,732
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
15,108 ÷ 11,732 = 1 + 3,376
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
11,732 ÷ 3,376 = 3 + 1,604
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,376 ÷ 1,604 = 2 + 168
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,604 ÷ 168 = 9 + 92
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
168 ÷ 92 = 1 + 76
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
92 ÷ 76 = 1 + 16
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
76 ÷ 16 = 4 + 12
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
16 ÷ 12 = 1 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
12 ÷ 4 = 3 + 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,048; 200,000,000,372) = 4 = 22
The two numbers have common prime factors