Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,066; 200,000,000,826) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,066 = 2 × 41 × 919 × 1,327
100,000,066 is not a prime number but a composite one.
200,000,000,826 = 2 × 33 × 4,051 × 914,269
200,000,000,826 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,826 ÷ 100,000,066 = 1,999 + 99,868,892
Step 2. Divide the smaller number by the above operation's remainder:
100,000,066 ÷ 99,868,892 = 1 + 131,174
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,868,892 ÷ 131,174 = 761 + 45,478
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
131,174 ÷ 45,478 = 2 + 40,218
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
45,478 ÷ 40,218 = 1 + 5,260
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
40,218 ÷ 5,260 = 7 + 3,398
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,260 ÷ 3,398 = 1 + 1,862
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,398 ÷ 1,862 = 1 + 1,536
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,862 ÷ 1,536 = 1 + 326
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,536 ÷ 326 = 4 + 232
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
326 ÷ 232 = 1 + 94
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
232 ÷ 94 = 2 + 44
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
94 ÷ 44 = 2 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
44 ÷ 6 = 7 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 2 = 3 + 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,066; 200,000,000,826) = 2
The two numbers have common prime factors