Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,026; 200,000,000,470) = ?
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,470 = 2 × 5 × 17 × 1,176,470,591
200,000,000,470 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,470 ÷ 100,000,026 = 1,999 + 99,948,496
Step 2. Divide the smaller number by the above operation's remainder:
100,000,026 ÷ 99,948,496 = 1 + 51,530
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,948,496 ÷ 51,530 = 1,939 + 31,826
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
51,530 ÷ 31,826 = 1 + 19,704
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
31,826 ÷ 19,704 = 1 + 12,122
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
19,704 ÷ 12,122 = 1 + 7,582
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
12,122 ÷ 7,582 = 1 + 4,540
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,582 ÷ 4,540 = 1 + 3,042
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,540 ÷ 3,042 = 1 + 1,498
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,042 ÷ 1,498 = 2 + 46
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,498 ÷ 46 = 32 + 26
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
46 ÷ 26 = 1 + 20
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
26 ÷ 20 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
20 ÷ 6 = 3 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 2 = 3 + 0
At this step, the remainder is zero, so we stop:
2 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,470) = 2
The two numbers have common prime factors