Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,165; 200,000,001,470) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,165 = 5 × 20,000,033
100,000,165 is not a prime number but a composite one.
200,000,001,470 = 2 × 5 × 11,593 × 1,725,179
200,000,001,470 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,001,470 ÷ 100,000,165 = 1,999 + 99,671,635
Step 2. Divide the smaller number by the above operation's remainder:
100,000,165 ÷ 99,671,635 = 1 + 328,530
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,671,635 ÷ 328,530 = 303 + 127,045
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
328,530 ÷ 127,045 = 2 + 74,440
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
127,045 ÷ 74,440 = 1 + 52,605
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
74,440 ÷ 52,605 = 1 + 21,835
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
52,605 ÷ 21,835 = 2 + 8,935
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
21,835 ÷ 8,935 = 2 + 3,965
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
8,935 ÷ 3,965 = 2 + 1,005
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,965 ÷ 1,005 = 3 + 950
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,005 ÷ 950 = 1 + 55
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
950 ÷ 55 = 17 + 15
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
55 ÷ 15 = 3 + 10
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
15 ÷ 10 = 1 + 5
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
10 ÷ 5 = 2 + 0
At this step, the remainder is zero, so we stop:
5 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,165; 200,000,001,470) = 5
The two numbers have common prime factors