Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,052; 200,000,000,962) = ?
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,962 = 2 × 71 × 383 × 641 × 5,737
200,000,000,962 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,962 ÷ 100,000,052 = 1,999 + 99,897,014
Step 2. Divide the smaller number by the above operation's remainder:
100,000,052 ÷ 99,897,014 = 1 + 103,038
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,897,014 ÷ 103,038 = 969 + 53,192
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
103,038 ÷ 53,192 = 1 + 49,846
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
53,192 ÷ 49,846 = 1 + 3,346
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
49,846 ÷ 3,346 = 14 + 3,002
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,346 ÷ 3,002 = 1 + 344
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,002 ÷ 344 = 8 + 250
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
344 ÷ 250 = 1 + 94
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
250 ÷ 94 = 2 + 62
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
94 ÷ 62 = 1 + 32
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
62 ÷ 32 = 1 + 30
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
32 ÷ 30 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
30 ÷ 2 = 15 + 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,962) = 2
The two numbers have common prime factors