Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,008; 200,000,000,298) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,008 = 23 × 34 × 154,321
100,000,008 is not a prime number but a composite one.
200,000,000,298 = 2 × 3 × 7 × 4,761,904,769
200,000,000,298 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,298 ÷ 100,000,008 = 1,999 + 99,984,306
Step 2. Divide the smaller number by the above operation's remainder:
100,000,008 ÷ 99,984,306 = 1 + 15,702
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,984,306 ÷ 15,702 = 6,367 + 9,672
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
15,702 ÷ 9,672 = 1 + 6,030
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
9,672 ÷ 6,030 = 1 + 3,642
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
6,030 ÷ 3,642 = 1 + 2,388
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,642 ÷ 2,388 = 1 + 1,254
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,388 ÷ 1,254 = 1 + 1,134
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,254 ÷ 1,134 = 1 + 120
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,134 ÷ 120 = 9 + 54
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
120 ÷ 54 = 2 + 12
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
54 ÷ 12 = 4 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
12 ÷ 6 = 2 + 0
At this step, the remainder is zero, so we stop:
6 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,008; 200,000,000,298) = 6 = 2 × 3
The two numbers have common prime factors