Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,035; 200,000,000,487) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,035 = 33 × 5 × 17 × 43,573
100,000,035 is not a prime number but a composite one.
200,000,000,487 = 3 × 72 × 17 × 80,032,013
200,000,000,487 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,487 ÷ 100,000,035 = 1,999 + 99,930,522
Step 2. Divide the smaller number by the above operation's remainder:
100,000,035 ÷ 99,930,522 = 1 + 69,513
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,930,522 ÷ 69,513 = 1,437 + 40,341
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
69,513 ÷ 40,341 = 1 + 29,172
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
40,341 ÷ 29,172 = 1 + 11,169
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
29,172 ÷ 11,169 = 2 + 6,834
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
11,169 ÷ 6,834 = 1 + 4,335
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,834 ÷ 4,335 = 1 + 2,499
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,335 ÷ 2,499 = 1 + 1,836
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,499 ÷ 1,836 = 1 + 663
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,836 ÷ 663 = 2 + 510
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
663 ÷ 510 = 1 + 153
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
510 ÷ 153 = 3 + 51
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
153 ÷ 51 = 3 + 0
At this step, the remainder is zero, so we stop:
51 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,035; 200,000,000,487) = 51 = 3 × 17
The two numbers have common prime factors