Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,052; 200,000,000,870) = ?
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,870 = 2 × 5 × 199 × 617 × 162,889
200,000,000,870 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,870 ÷ 100,000,052 = 1,999 + 99,896,922
Step 2. Divide the smaller number by the above operation's remainder:
100,000,052 ÷ 99,896,922 = 1 + 103,130
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,896,922 ÷ 103,130 = 968 + 67,082
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
103,130 ÷ 67,082 = 1 + 36,048
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
67,082 ÷ 36,048 = 1 + 31,034
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
36,048 ÷ 31,034 = 1 + 5,014
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
31,034 ÷ 5,014 = 6 + 950
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,014 ÷ 950 = 5 + 264
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
950 ÷ 264 = 3 + 158
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
264 ÷ 158 = 1 + 106
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
158 ÷ 106 = 1 + 52
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
106 ÷ 52 = 2 + 2
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
52 ÷ 2 = 26 + 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,870) = 2
The two numbers have common prime factors