Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,044; 199,999,999,898) = ?
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.
199,999,999,898 = 2 × 41 × 73 × 33,411,293
199,999,999,898 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:
199,999,999,898 ÷ 100,000,044 = 1,999 + 99,911,942
Step 2. Divide the smaller number by the above operation's remainder:
100,000,044 ÷ 99,911,942 = 1 + 88,102
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,911,942 ÷ 88,102 = 1,134 + 4,274
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
88,102 ÷ 4,274 = 20 + 2,622
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
4,274 ÷ 2,622 = 1 + 1,652
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
2,622 ÷ 1,652 = 1 + 970
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,652 ÷ 970 = 1 + 682
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
970 ÷ 682 = 1 + 288
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
682 ÷ 288 = 2 + 106
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
288 ÷ 106 = 2 + 76
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
106 ÷ 76 = 1 + 30
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
76 ÷ 30 = 2 + 16
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
30 ÷ 16 = 1 + 14
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
16 ÷ 14 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
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,044; 199,999,999,898) = 2
The two numbers have common prime factors