Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,054; 200,000,000,856) = ?
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,856 = 23 × 3 × 113 × 643 × 114,691
200,000,000,856 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,856 ÷ 100,000,054 = 1,999 + 99,892,910
Step 2. Divide the smaller number by the above operation's remainder:
100,000,054 ÷ 99,892,910 = 1 + 107,144
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,892,910 ÷ 107,144 = 932 + 34,702
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
107,144 ÷ 34,702 = 3 + 3,038
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
34,702 ÷ 3,038 = 11 + 1,284
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
3,038 ÷ 1,284 = 2 + 470
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,284 ÷ 470 = 2 + 344
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
470 ÷ 344 = 1 + 126
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
344 ÷ 126 = 2 + 92
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
126 ÷ 92 = 1 + 34
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
92 ÷ 34 = 2 + 24
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
34 ÷ 24 = 1 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
24 ÷ 10 = 2 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
10 ÷ 4 = 2 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
4 ÷ 2 = 2 + 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,054; 200,000,000,856) = 2
The two numbers have common prime factors