Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,155; 200,000,000,286) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,155 = 3 × 5 × 43 × 197 × 787
100,000,155 is not a prime number but a composite one.
200,000,000,286 = 2 × 34 × 29 × 42,571,307
200,000,000,286 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,286 ÷ 100,000,155 = 1,999 + 99,690,441
Step 2. Divide the smaller number by the above operation's remainder:
100,000,155 ÷ 99,690,441 = 1 + 309,714
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,690,441 ÷ 309,714 = 321 + 272,247
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
309,714 ÷ 272,247 = 1 + 37,467
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
272,247 ÷ 37,467 = 7 + 9,978
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
37,467 ÷ 9,978 = 3 + 7,533
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,978 ÷ 7,533 = 1 + 2,445
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,533 ÷ 2,445 = 3 + 198
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,445 ÷ 198 = 12 + 69
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
198 ÷ 69 = 2 + 60
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
69 ÷ 60 = 1 + 9
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
60 ÷ 9 = 6 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
9 ÷ 6 = 1 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 3 = 2 + 0
At this step, the remainder is zero, so we stop:
3 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,155; 200,000,000,286) = 3
The two numbers have common prime factors