Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,059; 200,000,000,541) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,059 = 3 × 19 × 1,754,387
100,000,059 is not a prime number but a composite one.
200,000,000,541 = 3 × 11 × 34,679 × 174,763
200,000,000,541 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,541 ÷ 100,000,059 = 1,999 + 99,882,600
Step 2. Divide the smaller number by the above operation's remainder:
100,000,059 ÷ 99,882,600 = 1 + 117,459
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,882,600 ÷ 117,459 = 850 + 42,450
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
117,459 ÷ 42,450 = 2 + 32,559
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
42,450 ÷ 32,559 = 1 + 9,891
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
32,559 ÷ 9,891 = 3 + 2,886
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,891 ÷ 2,886 = 3 + 1,233
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,886 ÷ 1,233 = 2 + 420
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,233 ÷ 420 = 2 + 393
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
420 ÷ 393 = 1 + 27
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
393 ÷ 27 = 14 + 15
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
27 ÷ 15 = 1 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
15 ÷ 12 = 1 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,059; 200,000,000,541) = 3
The two numbers have common prime factors