Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,054; 200,000,000,333) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,054 = 2 × 7 × 11 × 127 × 5,113
100,000,054 is not a prime number but a composite one.
200,000,000,333 = 7 × 19 × 1,503,759,401
200,000,000,333 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,333 ÷ 100,000,054 = 1,999 + 99,892,387
Step 2. Divide the smaller number by the above operation's remainder:
100,000,054 ÷ 99,892,387 = 1 + 107,667
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,892,387 ÷ 107,667 = 927 + 85,078
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
107,667 ÷ 85,078 = 1 + 22,589
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
85,078 ÷ 22,589 = 3 + 17,311
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
22,589 ÷ 17,311 = 1 + 5,278
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
17,311 ÷ 5,278 = 3 + 1,477
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,278 ÷ 1,477 = 3 + 847
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,477 ÷ 847 = 1 + 630
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
847 ÷ 630 = 1 + 217
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
630 ÷ 217 = 2 + 196
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
217 ÷ 196 = 1 + 21
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
196 ÷ 21 = 9 + 7
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
21 ÷ 7 = 3 + 0
At this step, the remainder is zero, so we stop:
7 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,054; 200,000,000,333) = 7
The two numbers have common prime factors