Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,011; 200,000,000,073) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,011 = 3 × 37 × 163 × 5,527
100,000,011 is not a prime number but a composite one.
200,000,000,073 = 3 × 11,057 × 6,029,363
200,000,000,073 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,073 ÷ 100,000,011 = 1,999 + 99,978,084
Step 2. Divide the smaller number by the above operation's remainder:
100,000,011 ÷ 99,978,084 = 1 + 21,927
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,978,084 ÷ 21,927 = 4,559 + 12,891
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
21,927 ÷ 12,891 = 1 + 9,036
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
12,891 ÷ 9,036 = 1 + 3,855
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
9,036 ÷ 3,855 = 2 + 1,326
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,855 ÷ 1,326 = 2 + 1,203
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,326 ÷ 1,203 = 1 + 123
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,203 ÷ 123 = 9 + 96
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
123 ÷ 96 = 1 + 27
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
96 ÷ 27 = 3 + 15
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
27 ÷ 15 = 1 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
15 ÷ 12 = 1 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 3 = 4 + 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,011; 200,000,000,073) = 3
The two numbers have common prime factors