Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,286; 200,000,000,096) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,286 = 2 × 199 × 251,257
100,000,286 is not a prime number but a composite one.
200,000,000,096 = 25 × 13 × 17 × 37 × 764,339
200,000,000,096 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,096 ÷ 100,000,286 = 1,999 + 99,428,382
Step 2. Divide the smaller number by the above operation's remainder:
100,000,286 ÷ 99,428,382 = 1 + 571,904
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,428,382 ÷ 571,904 = 173 + 488,990
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
571,904 ÷ 488,990 = 1 + 82,914
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
488,990 ÷ 82,914 = 5 + 74,420
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
82,914 ÷ 74,420 = 1 + 8,494
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
74,420 ÷ 8,494 = 8 + 6,468
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,494 ÷ 6,468 = 1 + 2,026
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6,468 ÷ 2,026 = 3 + 390
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,026 ÷ 390 = 5 + 76
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
390 ÷ 76 = 5 + 10
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
76 ÷ 10 = 7 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
10 ÷ 6 = 1 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 4 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
4 ÷ 2 = 2 + 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,286; 200,000,000,096) = 2
The two numbers have common prime factors