Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,038; 200,000,001,002) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,038 = 2 × 3 × 1,303 × 12,791
100,000,038 is not a prime number but a composite one.
200,000,001,002 = 2 × 43 × 31,723 × 73,309
200,000,001,002 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,002 ÷ 100,000,038 = 1,999 + 99,925,040
Step 2. Divide the smaller number by the above operation's remainder:
100,000,038 ÷ 99,925,040 = 1 + 74,998
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,925,040 ÷ 74,998 = 1,332 + 27,704
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,998 ÷ 27,704 = 2 + 19,590
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
27,704 ÷ 19,590 = 1 + 8,114
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
19,590 ÷ 8,114 = 2 + 3,362
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
8,114 ÷ 3,362 = 2 + 1,390
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,362 ÷ 1,390 = 2 + 582
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,390 ÷ 582 = 2 + 226
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
582 ÷ 226 = 2 + 130
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
226 ÷ 130 = 1 + 96
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
130 ÷ 96 = 1 + 34
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
96 ÷ 34 = 2 + 28
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
34 ÷ 28 = 1 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
28 ÷ 6 = 4 + 4
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 4 = 1 + 2
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
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,038; 200,000,001,002) = 2
The two numbers have common prime factors