Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,029; 200,000,000,778) = ?
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,778 = 2 × 3 × 33,333,333,463
200,000,000,778 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,778 ÷ 100,000,029 = 1,999 + 99,942,807
Step 2. Divide the smaller number by the above operation's remainder:
100,000,029 ÷ 99,942,807 = 1 + 57,222
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,942,807 ÷ 57,222 = 1,746 + 33,195
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
57,222 ÷ 33,195 = 1 + 24,027
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
33,195 ÷ 24,027 = 1 + 9,168
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
24,027 ÷ 9,168 = 2 + 5,691
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,168 ÷ 5,691 = 1 + 3,477
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,691 ÷ 3,477 = 1 + 2,214
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,477 ÷ 2,214 = 1 + 1,263
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,214 ÷ 1,263 = 1 + 951
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,263 ÷ 951 = 1 + 312
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
951 ÷ 312 = 3 + 15
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
312 ÷ 15 = 20 + 12
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
15 ÷ 12 = 1 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
12 ÷ 3 = 4 + 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,778) = 3
The two numbers have common prime factors