Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,108; 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,108 = 22 × 13 × 1,923,079
100,000,108 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,108 = 1,999 + 99,784,373
Step 2. Divide the smaller number by the above operation's remainder:
100,000,108 ÷ 99,784,373 = 1 + 215,735
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,784,373 ÷ 215,735 = 462 + 114,803
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
215,735 ÷ 114,803 = 1 + 100,932
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
114,803 ÷ 100,932 = 1 + 13,871
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
100,932 ÷ 13,871 = 7 + 3,835
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
13,871 ÷ 3,835 = 3 + 2,366
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,835 ÷ 2,366 = 1 + 1,469
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,366 ÷ 1,469 = 1 + 897
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,469 ÷ 897 = 1 + 572
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
897 ÷ 572 = 1 + 325
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
572 ÷ 325 = 1 + 247
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
325 ÷ 247 = 1 + 78
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
247 ÷ 78 = 3 + 13
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
78 ÷ 13 = 6 + 0
At this step, the remainder is zero, so we stop:
13 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,108; 200,000,000,265) = 13
The two numbers have common prime factors