Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,154; 200,000,001,078) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,154 = 2 × 17 × 19 × 154,799
100,000,154 is not a prime number but a composite one.
200,000,001,078 = 2 × 32 × 31 × 53 × 6,762,697
200,000,001,078 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,078 ÷ 100,000,154 = 1,999 + 99,693,232
Step 2. Divide the smaller number by the above operation's remainder:
100,000,154 ÷ 99,693,232 = 1 + 306,922
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,693,232 ÷ 306,922 = 324 + 250,504
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
306,922 ÷ 250,504 = 1 + 56,418
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
250,504 ÷ 56,418 = 4 + 24,832
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
56,418 ÷ 24,832 = 2 + 6,754
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
24,832 ÷ 6,754 = 3 + 4,570
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,754 ÷ 4,570 = 1 + 2,184
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,570 ÷ 2,184 = 2 + 202
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,184 ÷ 202 = 10 + 164
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
202 ÷ 164 = 1 + 38
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
164 ÷ 38 = 4 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
38 ÷ 12 = 3 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 2 = 6 + 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,154; 200,000,001,078) = 2
The two numbers have common prime factors