Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,170; 200,000,000,722) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,170 = 2 × 34 × 5 × 123,457
100,000,170 is not a prime number but a composite one.
200,000,000,722 = 2 × 211 × 473,933,651
200,000,000,722 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,722 ÷ 100,000,170 = 1,999 + 99,660,892
Step 2. Divide the smaller number by the above operation's remainder:
100,000,170 ÷ 99,660,892 = 1 + 339,278
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,660,892 ÷ 339,278 = 293 + 252,438
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
339,278 ÷ 252,438 = 1 + 86,840
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
252,438 ÷ 86,840 = 2 + 78,758
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
86,840 ÷ 78,758 = 1 + 8,082
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
78,758 ÷ 8,082 = 9 + 6,020
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,082 ÷ 6,020 = 1 + 2,062
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6,020 ÷ 2,062 = 2 + 1,896
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,062 ÷ 1,896 = 1 + 166
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,896 ÷ 166 = 11 + 70
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
166 ÷ 70 = 2 + 26
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
70 ÷ 26 = 2 + 18
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
26 ÷ 18 = 1 + 8
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
18 ÷ 8 = 2 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
8 ÷ 2 = 4 + 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,170; 200,000,000,722) = 2
The two numbers have common prime factors