Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,054; 200,000,000,216) = ?
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,216 = 23 × 491 × 50,916,497
200,000,000,216 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,216 ÷ 100,000,054 = 1,999 + 99,892,270
Step 2. Divide the smaller number by the above operation's remainder:
100,000,054 ÷ 99,892,270 = 1 + 107,784
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,892,270 ÷ 107,784 = 926 + 84,286
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
107,784 ÷ 84,286 = 1 + 23,498
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
84,286 ÷ 23,498 = 3 + 13,792
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
23,498 ÷ 13,792 = 1 + 9,706
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
13,792 ÷ 9,706 = 1 + 4,086
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
9,706 ÷ 4,086 = 2 + 1,534
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,086 ÷ 1,534 = 2 + 1,018
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,534 ÷ 1,018 = 1 + 516
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,018 ÷ 516 = 1 + 502
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
516 ÷ 502 = 1 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
502 ÷ 14 = 35 + 12
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
14 ÷ 12 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
12 ÷ 2 = 6 + 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,216) = 2
The two numbers have common prime factors