Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,035; 200,000,000,727) = ?
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,727 = 32 × 101 × 11,159 × 19,717
200,000,000,727 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,727 ÷ 100,000,035 = 1,999 + 99,930,762
Step 2. Divide the smaller number by the above operation's remainder:
100,000,035 ÷ 99,930,762 = 1 + 69,273
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,930,762 ÷ 69,273 = 1,442 + 39,096
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
69,273 ÷ 39,096 = 1 + 30,177
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
39,096 ÷ 30,177 = 1 + 8,919
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
30,177 ÷ 8,919 = 3 + 3,420
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
8,919 ÷ 3,420 = 2 + 2,079
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,420 ÷ 2,079 = 1 + 1,341
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,079 ÷ 1,341 = 1 + 738
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,341 ÷ 738 = 1 + 603
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
738 ÷ 603 = 1 + 135
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
603 ÷ 135 = 4 + 63
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
135 ÷ 63 = 2 + 9
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
63 ÷ 9 = 7 + 0
At this step, the remainder is zero, so we stop:
9 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,727) = 9 = 32
The two numbers have common prime factors