Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (139,999,932; 999,999,999,759) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
139,999,932 = 22 × 32 × 3,888,887
139,999,932 is not a prime number but a composite one.
999,999,999,759 = 3 × 61 × 5,464,480,873
999,999,999,759 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:
999,999,999,759 ÷ 139,999,932 = 7,142 + 120,485,415
Step 2. Divide the smaller number by the above operation's remainder:
139,999,932 ÷ 120,485,415 = 1 + 19,514,517
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
120,485,415 ÷ 19,514,517 = 6 + 3,398,313
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
19,514,517 ÷ 3,398,313 = 5 + 2,522,952
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
3,398,313 ÷ 2,522,952 = 1 + 875,361
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
2,522,952 ÷ 875,361 = 2 + 772,230
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
875,361 ÷ 772,230 = 1 + 103,131
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
772,230 ÷ 103,131 = 7 + 50,313
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
103,131 ÷ 50,313 = 2 + 2,505
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
50,313 ÷ 2,505 = 20 + 213
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
2,505 ÷ 213 = 11 + 162
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
213 ÷ 162 = 1 + 51
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
162 ÷ 51 = 3 + 9
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
51 ÷ 9 = 5 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
9 ÷ 6 = 1 + 3
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
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 (139,999,932; 999,999,999,759) = 3
The two numbers have common prime factors