Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (139,999,912; 999,999,999,886) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
139,999,912 = 23 × 13 × 41 × 32,833
139,999,912 is not a prime number but a composite one.
999,999,999,886 = 2 × 499,999,999,943
999,999,999,886 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,886 ÷ 139,999,912 = 7,142 + 120,628,382
Step 2. Divide the smaller number by the above operation's remainder:
139,999,912 ÷ 120,628,382 = 1 + 19,371,530
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
120,628,382 ÷ 19,371,530 = 6 + 4,399,202
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
19,371,530 ÷ 4,399,202 = 4 + 1,774,722
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
4,399,202 ÷ 1,774,722 = 2 + 849,758
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
1,774,722 ÷ 849,758 = 2 + 75,206
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
849,758 ÷ 75,206 = 11 + 22,492
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
75,206 ÷ 22,492 = 3 + 7,730
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
22,492 ÷ 7,730 = 2 + 7,032
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
7,730 ÷ 7,032 = 1 + 698
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
7,032 ÷ 698 = 10 + 52
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
698 ÷ 52 = 13 + 22
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
52 ÷ 22 = 2 + 8
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
22 ÷ 8 = 2 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
8 ÷ 6 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 2 = 3 + 0
At this step, the remainder is zero, so we stop:
2 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,912; 999,999,999,886) = 2
The two numbers have common prime factors