Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,053; 200,000,000,418) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,053 = 32 × 11,111,117
100,000,053 is not a prime number but a composite one.
200,000,000,418 = 2 × 3 × 149 × 181 × 1,235,987
200,000,000,418 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,418 ÷ 100,000,053 = 1,999 + 99,894,471
Step 2. Divide the smaller number by the above operation's remainder:
100,000,053 ÷ 99,894,471 = 1 + 105,582
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,894,471 ÷ 105,582 = 946 + 13,899
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
105,582 ÷ 13,899 = 7 + 8,289
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
13,899 ÷ 8,289 = 1 + 5,610
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
8,289 ÷ 5,610 = 1 + 2,679
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,610 ÷ 2,679 = 2 + 252
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,679 ÷ 252 = 10 + 159
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
252 ÷ 159 = 1 + 93
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
159 ÷ 93 = 1 + 66
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
93 ÷ 66 = 1 + 27
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
66 ÷ 27 = 2 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
27 ÷ 12 = 2 + 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,053; 200,000,000,418) = 3
The two numbers have common prime factors