Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,150; 200,000,000,842) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,150 = 2 × 52 × 2,000,003
100,000,150 is not a prime number but a composite one.
200,000,000,842 = 2 × 719 × 2,467 × 56,377
200,000,000,842 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,842 ÷ 100,000,150 = 1,999 + 99,700,992
Step 2. Divide the smaller number by the above operation's remainder:
100,000,150 ÷ 99,700,992 = 1 + 299,158
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,700,992 ÷ 299,158 = 333 + 81,378
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
299,158 ÷ 81,378 = 3 + 55,024
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
81,378 ÷ 55,024 = 1 + 26,354
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
55,024 ÷ 26,354 = 2 + 2,316
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
26,354 ÷ 2,316 = 11 + 878
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,316 ÷ 878 = 2 + 560
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
878 ÷ 560 = 1 + 318
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
560 ÷ 318 = 1 + 242
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
318 ÷ 242 = 1 + 76
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
242 ÷ 76 = 3 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
76 ÷ 14 = 5 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
14 ÷ 6 = 2 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 2 = 3 + 0
At this step, the remainder is zero, so we stop:
2 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,150; 200,000,000,842) = 2
The two numbers have common prime factors