Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,053; 200,000,000,577) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,053 = 32 × 11,111,117
100,000,053 is not a prime number but a composite one.
200,000,000,577 = 3 × 13 × 23 × 37 × 1,429 × 4,217
200,000,000,577 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,577 ÷ 100,000,053 = 1,999 + 99,894,630
Step 2. Divide the smaller number by the above operation's remainder:
100,000,053 ÷ 99,894,630 = 1 + 105,423
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,894,630 ÷ 105,423 = 947 + 59,049
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
105,423 ÷ 59,049 = 1 + 46,374
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
59,049 ÷ 46,374 = 1 + 12,675
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
46,374 ÷ 12,675 = 3 + 8,349
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
12,675 ÷ 8,349 = 1 + 4,326
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,349 ÷ 4,326 = 1 + 4,023
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,326 ÷ 4,023 = 1 + 303
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
4,023 ÷ 303 = 13 + 84
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
303 ÷ 84 = 3 + 51
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
84 ÷ 51 = 1 + 33
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
51 ÷ 33 = 1 + 18
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
33 ÷ 18 = 1 + 15
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
18 ÷ 15 = 1 + 3
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
15 ÷ 3 = 5 + 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,053; 200,000,000,577) = 3
The two numbers have common prime factors