Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,041; 200,000,000,556) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,041 = 3 × 33,333,347
100,000,041 is not a prime number but a composite one.
200,000,000,556 = 22 × 33 × 1,851,851,857
200,000,000,556 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,556 ÷ 100,000,041 = 1,999 + 99,918,597
Step 2. Divide the smaller number by the above operation's remainder:
100,000,041 ÷ 99,918,597 = 1 + 81,444
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,918,597 ÷ 81,444 = 1,226 + 68,253
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
81,444 ÷ 68,253 = 1 + 13,191
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
68,253 ÷ 13,191 = 5 + 2,298
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
13,191 ÷ 2,298 = 5 + 1,701
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,298 ÷ 1,701 = 1 + 597
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,701 ÷ 597 = 2 + 507
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
597 ÷ 507 = 1 + 90
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
507 ÷ 90 = 5 + 57
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
90 ÷ 57 = 1 + 33
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
57 ÷ 33 = 1 + 24
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
33 ÷ 24 = 1 + 9
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
24 ÷ 9 = 2 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
9 ÷ 6 = 1 + 3
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 3 = 2 + 0
At this step, the remainder is zero, so we stop:
3 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,041; 200,000,000,556) = 3
The two numbers have common prime factors