Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,026; 200,000,000,730) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,026 = 2 × 32 × 7 × 43 × 18,457
100,000,026 is not a prime number but a composite one.
200,000,000,730 = 2 × 3 × 5 × 1,049 × 6,355,259
200,000,000,730 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,730 ÷ 100,000,026 = 1,999 + 99,948,756
Step 2. Divide the smaller number by the above operation's remainder:
100,000,026 ÷ 99,948,756 = 1 + 51,270
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,948,756 ÷ 51,270 = 1,949 + 23,526
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
51,270 ÷ 23,526 = 2 + 4,218
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
23,526 ÷ 4,218 = 5 + 2,436
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
4,218 ÷ 2,436 = 1 + 1,782
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,436 ÷ 1,782 = 1 + 654
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,782 ÷ 654 = 2 + 474
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
654 ÷ 474 = 1 + 180
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
474 ÷ 180 = 2 + 114
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
180 ÷ 114 = 1 + 66
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
114 ÷ 66 = 1 + 48
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
66 ÷ 48 = 1 + 18
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
48 ÷ 18 = 2 + 12
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
18 ÷ 12 = 1 + 6
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
12 ÷ 6 = 2 + 0
At this step, the remainder is zero, so we stop:
6 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,026; 200,000,000,730) = 6 = 2 × 3
The two numbers have common prime factors