Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,185; 200,000,001,270) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,185 = 3 × 5 × 6,666,679
100,000,185 is not a prime number but a composite one.
200,000,001,270 = 2 × 3 × 5 × 59 × 139 × 853 × 953
200,000,001,270 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,001,270 ÷ 100,000,185 = 1,999 + 99,631,455
Step 2. Divide the smaller number by the above operation's remainder:
100,000,185 ÷ 99,631,455 = 1 + 368,730
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,631,455 ÷ 368,730 = 270 + 74,355
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
368,730 ÷ 74,355 = 4 + 71,310
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
74,355 ÷ 71,310 = 1 + 3,045
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
71,310 ÷ 3,045 = 23 + 1,275
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,045 ÷ 1,275 = 2 + 495
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,275 ÷ 495 = 2 + 285
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
495 ÷ 285 = 1 + 210
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
285 ÷ 210 = 1 + 75
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
210 ÷ 75 = 2 + 60
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
75 ÷ 60 = 1 + 15
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
60 ÷ 15 = 4 + 0
At this step, the remainder is zero, so we stop:
15 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,185; 200,000,001,270) = 15 = 3 × 5
The two numbers have common prime factors