Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,044; 200,000,000,469) = ?
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,469 = 3 × 907 × 2,677 × 27,457
200,000,000,469 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,469 ÷ 100,000,044 = 1,999 + 99,912,513
Step 2. Divide the smaller number by the above operation's remainder:
100,000,044 ÷ 99,912,513 = 1 + 87,531
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,912,513 ÷ 87,531 = 1,141 + 39,642
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
87,531 ÷ 39,642 = 2 + 8,247
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
39,642 ÷ 8,247 = 4 + 6,654
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
8,247 ÷ 6,654 = 1 + 1,593
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
6,654 ÷ 1,593 = 4 + 282
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,593 ÷ 282 = 5 + 183
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
282 ÷ 183 = 1 + 99
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
183 ÷ 99 = 1 + 84
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
99 ÷ 84 = 1 + 15
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
84 ÷ 15 = 5 + 9
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
15 ÷ 9 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
9 ÷ 6 = 1 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 3 = 2 + 0
At this step, the remainder is zero, so we stop:
3 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,469) = 3
The two numbers have common prime factors