Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,044; 200,000,000,267) = ?
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,267 = 41 × 59 × 79 × 107 × 9,781
200,000,000,267 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,267 ÷ 100,000,044 = 1,999 + 99,912,311
Step 2. Divide the smaller number by the above operation's remainder:
100,000,044 ÷ 99,912,311 = 1 + 87,733
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,912,311 ÷ 87,733 = 1,138 + 72,157
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
87,733 ÷ 72,157 = 1 + 15,576
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
72,157 ÷ 15,576 = 4 + 9,853
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
15,576 ÷ 9,853 = 1 + 5,723
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,853 ÷ 5,723 = 1 + 4,130
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,723 ÷ 4,130 = 1 + 1,593
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,130 ÷ 1,593 = 2 + 944
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,593 ÷ 944 = 1 + 649
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
944 ÷ 649 = 1 + 295
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
649 ÷ 295 = 2 + 59
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
295 ÷ 59 = 5 + 0
At this step, the remainder is zero, so we stop:
59 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,267) = 59
The two numbers have common prime factors