Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,035; 200,000,000,155) = ?
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,155 = 5 × 40,000,000,031
200,000,000,155 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,155 ÷ 100,000,035 = 1,999 + 99,930,190
Step 2. Divide the smaller number by the above operation's remainder:
100,000,035 ÷ 99,930,190 = 1 + 69,845
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,930,190 ÷ 69,845 = 1,430 + 51,840
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
69,845 ÷ 51,840 = 1 + 18,005
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
51,840 ÷ 18,005 = 2 + 15,830
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
18,005 ÷ 15,830 = 1 + 2,175
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
15,830 ÷ 2,175 = 7 + 605
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,175 ÷ 605 = 3 + 360
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
605 ÷ 360 = 1 + 245
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
360 ÷ 245 = 1 + 115
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
245 ÷ 115 = 2 + 15
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
115 ÷ 15 = 7 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
15 ÷ 10 = 1 + 5
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,035; 200,000,000,155) = 5
The two numbers have common prime factors