Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,060; 200,000,000,285) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,060 = 22 × 5 × 83 × 107 × 563
100,000,060 is not a prime number but a composite one.
200,000,000,285 = 5 × 47 × 2,063 × 412,537
200,000,000,285 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,285 ÷ 100,000,060 = 1,999 + 99,880,345
Step 2. Divide the smaller number by the above operation's remainder:
100,000,060 ÷ 99,880,345 = 1 + 119,715
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,880,345 ÷ 119,715 = 834 + 38,035
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
119,715 ÷ 38,035 = 3 + 5,610
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
38,035 ÷ 5,610 = 6 + 4,375
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
5,610 ÷ 4,375 = 1 + 1,235
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,375 ÷ 1,235 = 3 + 670
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,235 ÷ 670 = 1 + 565
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
670 ÷ 565 = 1 + 105
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
565 ÷ 105 = 5 + 40
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
105 ÷ 40 = 2 + 25
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
40 ÷ 25 = 1 + 15
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
25 ÷ 15 = 1 + 10
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
15 ÷ 10 = 1 + 5
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
10 ÷ 5 = 2 + 0
At this step, the remainder is zero, so we stop:
5 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,060; 200,000,000,285) = 5
The two numbers have common prime factors