Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,040; 200,000,000,454) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,040 = 23 × 5 × 7 × 19 × 18,797
100,000,040 is not a prime number but a composite one.
200,000,000,454 = 2 × 3 × 1,223 × 27,255,383
200,000,000,454 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,454 ÷ 100,000,040 = 1,999 + 99,920,494
Step 2. Divide the smaller number by the above operation's remainder:
100,000,040 ÷ 99,920,494 = 1 + 79,546
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,920,494 ÷ 79,546 = 1,256 + 10,718
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
79,546 ÷ 10,718 = 7 + 4,520
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
10,718 ÷ 4,520 = 2 + 1,678
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
4,520 ÷ 1,678 = 2 + 1,164
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,678 ÷ 1,164 = 1 + 514
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,164 ÷ 514 = 2 + 136
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
514 ÷ 136 = 3 + 106
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
136 ÷ 106 = 1 + 30
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
106 ÷ 30 = 3 + 16
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
30 ÷ 16 = 1 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
16 ÷ 14 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
14 ÷ 2 = 7 + 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,040; 200,000,000,454) = 2
The two numbers have common prime factors