Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,040; 200,000,000,554) = ?
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,554 = 2 × 23 × 41 × 239 × 443,701
200,000,000,554 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,554 ÷ 100,000,040 = 1,999 + 99,920,594
Step 2. Divide the smaller number by the above operation's remainder:
100,000,040 ÷ 99,920,594 = 1 + 79,446
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,920,594 ÷ 79,446 = 1,257 + 56,972
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
79,446 ÷ 56,972 = 1 + 22,474
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
56,972 ÷ 22,474 = 2 + 12,024
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
22,474 ÷ 12,024 = 1 + 10,450
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
12,024 ÷ 10,450 = 1 + 1,574
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
10,450 ÷ 1,574 = 6 + 1,006
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,574 ÷ 1,006 = 1 + 568
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,006 ÷ 568 = 1 + 438
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
568 ÷ 438 = 1 + 130
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
438 ÷ 130 = 3 + 48
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
130 ÷ 48 = 2 + 34
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
48 ÷ 34 = 1 + 14
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
34 ÷ 14 = 2 + 6
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
14 ÷ 6 = 2 + 2
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
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,040; 200,000,000,554) = 2
The two numbers have common prime factors