Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,144; 200,000,001,248) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,144 = 24 × 6,250,009
100,000,144 is not a prime number but a composite one.
200,000,001,248 = 25 × 3,169 × 1,972,231
200,000,001,248 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,001,248 ÷ 100,000,144 = 1,999 + 99,713,392
Step 2. Divide the smaller number by the above operation's remainder:
100,000,144 ÷ 99,713,392 = 1 + 286,752
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,713,392 ÷ 286,752 = 347 + 210,448
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
286,752 ÷ 210,448 = 1 + 76,304
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
210,448 ÷ 76,304 = 2 + 57,840
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
76,304 ÷ 57,840 = 1 + 18,464
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
57,840 ÷ 18,464 = 3 + 2,448
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
18,464 ÷ 2,448 = 7 + 1,328
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,448 ÷ 1,328 = 1 + 1,120
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,328 ÷ 1,120 = 1 + 208
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,120 ÷ 208 = 5 + 80
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
208 ÷ 80 = 2 + 48
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
80 ÷ 48 = 1 + 32
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
48 ÷ 32 = 1 + 16
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
32 ÷ 16 = 2 + 0
At this step, the remainder is zero, so we stop:
16 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,144; 200,000,001,248) = 16 = 24
The two numbers have common prime factors