Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,026; 200,000,000,230) = ?
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,230 = 2 × 5 × 53 × 4,339 × 86,969
200,000,000,230 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,230 ÷ 100,000,026 = 1,999 + 99,948,256
Step 2. Divide the smaller number by the above operation's remainder:
100,000,026 ÷ 99,948,256 = 1 + 51,770
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,948,256 ÷ 51,770 = 1,930 + 32,156
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
51,770 ÷ 32,156 = 1 + 19,614
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
32,156 ÷ 19,614 = 1 + 12,542
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
19,614 ÷ 12,542 = 1 + 7,072
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
12,542 ÷ 7,072 = 1 + 5,470
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,072 ÷ 5,470 = 1 + 1,602
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,470 ÷ 1,602 = 3 + 664
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,602 ÷ 664 = 2 + 274
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
664 ÷ 274 = 2 + 116
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
274 ÷ 116 = 2 + 42
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
116 ÷ 42 = 2 + 32
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
42 ÷ 32 = 1 + 10
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
32 ÷ 10 = 3 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
10 ÷ 2 = 5 + 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,230) = 2
The two numbers have common prime factors