Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,146; 200,000,000,201) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,146 = 2 × 3 × 587 × 28,393
100,000,146 is not a prime number but a composite one.
200,000,000,201 is a prime number and cannot be broken down into other prime factors.
- 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).
But the two numbers have no common prime factors.
Step 1. Divide the larger number by the smaller one:
200,000,000,201 ÷ 100,000,146 = 1,999 + 99,708,347
Step 2. Divide the smaller number by the above operation's remainder:
100,000,146 ÷ 99,708,347 = 1 + 291,799
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,708,347 ÷ 291,799 = 341 + 204,888
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
291,799 ÷ 204,888 = 1 + 86,911
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
204,888 ÷ 86,911 = 2 + 31,066
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
86,911 ÷ 31,066 = 2 + 24,779
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
31,066 ÷ 24,779 = 1 + 6,287
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
24,779 ÷ 6,287 = 3 + 5,918
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6,287 ÷ 5,918 = 1 + 369
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
5,918 ÷ 369 = 16 + 14
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
369 ÷ 14 = 26 + 5
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
14 ÷ 5 = 2 + 4
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
5 ÷ 4 = 1 + 1
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
4 ÷ 1 = 4 + 0
At this step, the remainder is zero, so we stop:
1 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,146; 200,000,000,201) = 1
Coprime numbers (prime to each other, relatively prime).
The two numbers have no prime factors in common