Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,896; 200,000,000,920) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,896 = 23 × 12,499,987
99,999,896 is not a prime number but a composite one.
200,000,000,920 = 23 × 5 × 73 × 68,493,151
200,000,000,920 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,920 ÷ 99,999,896 = 2,000 + 208,920
Step 2. Divide the smaller number by the above operation's remainder:
99,999,896 ÷ 208,920 = 478 + 136,136
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
208,920 ÷ 136,136 = 1 + 72,784
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
136,136 ÷ 72,784 = 1 + 63,352
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
72,784 ÷ 63,352 = 1 + 9,432
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
63,352 ÷ 9,432 = 6 + 6,760
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,432 ÷ 6,760 = 1 + 2,672
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,760 ÷ 2,672 = 2 + 1,416
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,672 ÷ 1,416 = 1 + 1,256
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,416 ÷ 1,256 = 1 + 160
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,256 ÷ 160 = 7 + 136
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
160 ÷ 136 = 1 + 24
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
136 ÷ 24 = 5 + 16
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
24 ÷ 16 = 1 + 8
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
16 ÷ 8 = 2 + 0
At this step, the remainder is zero, so we stop:
8 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,896; 200,000,000,920) = 8 = 23
The two numbers have common prime factors