Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,089; 200,000,000,901) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,089 = 35 × 7 × 58,789
100,000,089 is not a prime number but a composite one.
200,000,000,901 = 3 × 66,666,666,967
200,000,000,901 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,901 ÷ 100,000,089 = 1,999 + 99,822,990
Step 2. Divide the smaller number by the above operation's remainder:
100,000,089 ÷ 99,822,990 = 1 + 177,099
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,822,990 ÷ 177,099 = 563 + 116,253
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
177,099 ÷ 116,253 = 1 + 60,846
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
116,253 ÷ 60,846 = 1 + 55,407
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
60,846 ÷ 55,407 = 1 + 5,439
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
55,407 ÷ 5,439 = 10 + 1,017
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,439 ÷ 1,017 = 5 + 354
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,017 ÷ 354 = 2 + 309
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
354 ÷ 309 = 1 + 45
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
309 ÷ 45 = 6 + 39
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
45 ÷ 39 = 1 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
39 ÷ 6 = 6 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 3 = 2 + 0
At this step, the remainder is zero, so we stop:
3 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,089; 200,000,000,901) = 3
The two numbers have common prime factors