Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,052; 200,000,000,610) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,052 = 22 × 17 × 151 × 9,739
100,000,052 is not a prime number but a composite one.
200,000,000,610 = 2 × 35 × 5 × 443 × 185,789
200,000,000,610 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,610 ÷ 100,000,052 = 1,999 + 99,896,662
Step 2. Divide the smaller number by the above operation's remainder:
100,000,052 ÷ 99,896,662 = 1 + 103,390
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,896,662 ÷ 103,390 = 966 + 21,922
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
103,390 ÷ 21,922 = 4 + 15,702
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
21,922 ÷ 15,702 = 1 + 6,220
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
15,702 ÷ 6,220 = 2 + 3,262
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
6,220 ÷ 3,262 = 1 + 2,958
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,262 ÷ 2,958 = 1 + 304
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,958 ÷ 304 = 9 + 222
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
304 ÷ 222 = 1 + 82
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
222 ÷ 82 = 2 + 58
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
82 ÷ 58 = 1 + 24
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
58 ÷ 24 = 2 + 10
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
24 ÷ 10 = 2 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
10 ÷ 4 = 2 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
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,052; 200,000,000,610) = 2
The two numbers have common prime factors