Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,982; 200,000,000,824) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,982 = 2 × 49,999,991
99,999,982 is not a prime number but a composite one.
200,000,000,824 = 23 × 13 × 1,923,076,931
200,000,000,824 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,824 ÷ 99,999,982 = 2,000 + 36,824
Step 2. Divide the smaller number by the above operation's remainder:
99,999,982 ÷ 36,824 = 2,715 + 22,822
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
36,824 ÷ 22,822 = 1 + 14,002
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
22,822 ÷ 14,002 = 1 + 8,820
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
14,002 ÷ 8,820 = 1 + 5,182
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
8,820 ÷ 5,182 = 1 + 3,638
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,182 ÷ 3,638 = 1 + 1,544
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,638 ÷ 1,544 = 2 + 550
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,544 ÷ 550 = 2 + 444
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
550 ÷ 444 = 1 + 106
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
444 ÷ 106 = 4 + 20
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
106 ÷ 20 = 5 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
20 ÷ 6 = 3 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 2 = 3 + 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 (99,999,982; 200,000,000,824) = 2
The two numbers have common prime factors