Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,082; 200,000,000,456) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,082 = 2 × 72 × 13 × 53 × 1,481
100,000,082 is not a prime number but a composite one.
200,000,000,456 = 23 × 769 × 32,509,753
200,000,000,456 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,456 ÷ 100,000,082 = 1,999 + 99,836,538
Step 2. Divide the smaller number by the above operation's remainder:
100,000,082 ÷ 99,836,538 = 1 + 163,544
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,836,538 ÷ 163,544 = 610 + 74,698
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
163,544 ÷ 74,698 = 2 + 14,148
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
74,698 ÷ 14,148 = 5 + 3,958
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
14,148 ÷ 3,958 = 3 + 2,274
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,958 ÷ 2,274 = 1 + 1,684
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,274 ÷ 1,684 = 1 + 590
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,684 ÷ 590 = 2 + 504
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
590 ÷ 504 = 1 + 86
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
504 ÷ 86 = 5 + 74
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
86 ÷ 74 = 1 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
74 ÷ 12 = 6 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,082; 200,000,000,456) = 2
The two numbers have common prime factors