Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,096; 200,000,000,318) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,096 = 25 × 7 × 79 × 5,651
100,000,096 is not a prime number but a composite one.
200,000,000,318 = 2 × 37 × 173 × 401 × 38,959
200,000,000,318 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,318 ÷ 100,000,096 = 1,999 + 99,808,414
Step 2. Divide the smaller number by the above operation's remainder:
100,000,096 ÷ 99,808,414 = 1 + 191,682
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,808,414 ÷ 191,682 = 520 + 133,774
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
191,682 ÷ 133,774 = 1 + 57,908
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
133,774 ÷ 57,908 = 2 + 17,958
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
57,908 ÷ 17,958 = 3 + 4,034
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
17,958 ÷ 4,034 = 4 + 1,822
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,034 ÷ 1,822 = 2 + 390
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,822 ÷ 390 = 4 + 262
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
390 ÷ 262 = 1 + 128
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
262 ÷ 128 = 2 + 6
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
128 ÷ 6 = 21 + 2
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
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 (100,000,096; 200,000,000,318) = 2
The two numbers have common prime factors