Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,044; 200,000,000,724) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,044 = 22 × 32 × 232 × 59 × 89
100,000,044 is not a prime number but a composite one.
200,000,000,724 = 22 × 3 × 16,666,666,727
200,000,000,724 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,724 ÷ 100,000,044 = 1,999 + 99,912,768
Step 2. Divide the smaller number by the above operation's remainder:
100,000,044 ÷ 99,912,768 = 1 + 87,276
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,912,768 ÷ 87,276 = 1,144 + 69,024
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
87,276 ÷ 69,024 = 1 + 18,252
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
69,024 ÷ 18,252 = 3 + 14,268
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
18,252 ÷ 14,268 = 1 + 3,984
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
14,268 ÷ 3,984 = 3 + 2,316
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,984 ÷ 2,316 = 1 + 1,668
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,316 ÷ 1,668 = 1 + 648
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,668 ÷ 648 = 2 + 372
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
648 ÷ 372 = 1 + 276
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
372 ÷ 276 = 1 + 96
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
276 ÷ 96 = 2 + 84
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
96 ÷ 84 = 1 + 12
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
84 ÷ 12 = 7 + 0
At this step, the remainder is zero, so we stop:
12 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,044; 200,000,000,724) = 12 = 22 × 3
The two numbers have common prime factors