Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,029; 200,000,000,970) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,029 = 3 × 53 × 131 × 4,801
100,000,029 is not a prime number but a composite one.
200,000,000,970 = 2 × 32 × 5 × 7 × 112 × 2,623,639
200,000,000,970 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,970 ÷ 100,000,029 = 1,999 + 99,942,999
Step 2. Divide the smaller number by the above operation's remainder:
100,000,029 ÷ 99,942,999 = 1 + 57,030
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,942,999 ÷ 57,030 = 1,752 + 26,439
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
57,030 ÷ 26,439 = 2 + 4,152
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
26,439 ÷ 4,152 = 6 + 1,527
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
4,152 ÷ 1,527 = 2 + 1,098
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,527 ÷ 1,098 = 1 + 429
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,098 ÷ 429 = 2 + 240
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
429 ÷ 240 = 1 + 189
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
240 ÷ 189 = 1 + 51
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
189 ÷ 51 = 3 + 36
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
51 ÷ 36 = 1 + 15
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
36 ÷ 15 = 2 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
15 ÷ 6 = 2 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 3 = 2 + 0
At this step, the remainder is zero, so we stop:
3 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,029; 200,000,000,970) = 3
The two numbers have common prime factors