Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,092; 200,000,000,265) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,092 = 22 × 3 × 71 × 117,371
100,000,092 is not a prime number but a composite one.
200,000,000,265 = 3 × 5 × 13 × 479 × 2,141,213
200,000,000,265 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,265 ÷ 100,000,092 = 1,999 + 99,816,357
Step 2. Divide the smaller number by the above operation's remainder:
100,000,092 ÷ 99,816,357 = 1 + 183,735
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,816,357 ÷ 183,735 = 543 + 48,252
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
183,735 ÷ 48,252 = 3 + 38,979
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
48,252 ÷ 38,979 = 1 + 9,273
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
38,979 ÷ 9,273 = 4 + 1,887
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,273 ÷ 1,887 = 4 + 1,725
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,887 ÷ 1,725 = 1 + 162
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,725 ÷ 162 = 10 + 105
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
162 ÷ 105 = 1 + 57
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
105 ÷ 57 = 1 + 48
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
57 ÷ 48 = 1 + 9
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
48 ÷ 9 = 5 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
9 ÷ 3 = 3 + 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,092; 200,000,000,265) = 3
The two numbers have common prime factors