Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,082; 200,000,000,142) = ?
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,142 = 2 × 32 × 43 × 258,397,933
200,000,000,142 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,142 ÷ 100,000,082 = 1,999 + 99,836,224
Step 2. Divide the smaller number by the above operation's remainder:
100,000,082 ÷ 99,836,224 = 1 + 163,858
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,836,224 ÷ 163,858 = 609 + 46,702
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
163,858 ÷ 46,702 = 3 + 23,752
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
46,702 ÷ 23,752 = 1 + 22,950
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
23,752 ÷ 22,950 = 1 + 802
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
22,950 ÷ 802 = 28 + 494
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
802 ÷ 494 = 1 + 308
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
494 ÷ 308 = 1 + 186
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
308 ÷ 186 = 1 + 122
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
186 ÷ 122 = 1 + 64
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
122 ÷ 64 = 1 + 58
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
64 ÷ 58 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
58 ÷ 6 = 9 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 4 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
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,082; 200,000,000,142) = 2
The two numbers have common prime factors