Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,096; 200,000,000,260) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,096 = 25 × 7 × 79 × 5,651
100,000,096 is not a prime number but a composite one.
200,000,000,260 = 22 × 5 × 18,041 × 554,293
200,000,000,260 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,260 ÷ 100,000,096 = 1,999 + 99,808,356
Step 2. Divide the smaller number by the above operation's remainder:
100,000,096 ÷ 99,808,356 = 1 + 191,740
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,808,356 ÷ 191,740 = 520 + 103,556
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
191,740 ÷ 103,556 = 1 + 88,184
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
103,556 ÷ 88,184 = 1 + 15,372
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
88,184 ÷ 15,372 = 5 + 11,324
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
15,372 ÷ 11,324 = 1 + 4,048
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
11,324 ÷ 4,048 = 2 + 3,228
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,048 ÷ 3,228 = 1 + 820
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,228 ÷ 820 = 3 + 768
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
820 ÷ 768 = 1 + 52
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
768 ÷ 52 = 14 + 40
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
52 ÷ 40 = 1 + 12
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
40 ÷ 12 = 3 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
12 ÷ 4 = 3 + 0
At this step, the remainder is zero, so we stop:
4 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,096; 200,000,000,260) = 4 = 22
The two numbers have common prime factors