Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,244; 199,999,999,962) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,244 = 22 × 3,041 × 8,221
100,000,244 is not a prime number but a composite one.
199,999,999,962 = 2 × 34 × 7 × 31 × 613 × 9,281
199,999,999,962 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,962 ÷ 100,000,244 = 1,999 + 99,512,206
Step 2. Divide the smaller number by the above operation's remainder:
100,000,244 ÷ 99,512,206 = 1 + 488,038
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,512,206 ÷ 488,038 = 203 + 440,492
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
488,038 ÷ 440,492 = 1 + 47,546
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
440,492 ÷ 47,546 = 9 + 12,578
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
47,546 ÷ 12,578 = 3 + 9,812
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
12,578 ÷ 9,812 = 1 + 2,766
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
9,812 ÷ 2,766 = 3 + 1,514
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,766 ÷ 1,514 = 1 + 1,252
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,514 ÷ 1,252 = 1 + 262
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,252 ÷ 262 = 4 + 204
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
262 ÷ 204 = 1 + 58
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
204 ÷ 58 = 3 + 30
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
58 ÷ 30 = 1 + 28
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
30 ÷ 28 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
28 ÷ 2 = 14 + 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,244; 199,999,999,962) = 2
The two numbers have common prime factors