Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,094; 200,000,000,952) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,094 = 2 × 50,000,047
100,000,094 is not a prime number but a composite one.
200,000,000,952 = 23 × 32 × 379 × 7,329,229
200,000,000,952 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,952 ÷ 100,000,094 = 1,999 + 99,813,046
Step 2. Divide the smaller number by the above operation's remainder:
100,000,094 ÷ 99,813,046 = 1 + 187,048
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,813,046 ÷ 187,048 = 533 + 116,462
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
187,048 ÷ 116,462 = 1 + 70,586
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
116,462 ÷ 70,586 = 1 + 45,876
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
70,586 ÷ 45,876 = 1 + 24,710
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
45,876 ÷ 24,710 = 1 + 21,166
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
24,710 ÷ 21,166 = 1 + 3,544
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
21,166 ÷ 3,544 = 5 + 3,446
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,544 ÷ 3,446 = 1 + 98
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
3,446 ÷ 98 = 35 + 16
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
98 ÷ 16 = 6 + 2
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
16 ÷ 2 = 8 + 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,094; 200,000,000,952) = 2
The two numbers have common prime factors