Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (999,999,999,896; 12,524,590) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
999,999,999,896 = 23 × 719 × 941 × 184,753
999,999,999,896 is not a prime number but a composite one.
12,524,590 = 2 × 5 × 132 × 7,411
12,524,590 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,896 ÷ 12,524,590 = 79,842 + 11,685,116
Step 2. Divide the smaller number by the above operation's remainder:
12,524,590 ÷ 11,685,116 = 1 + 839,474
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
11,685,116 ÷ 839,474 = 13 + 771,954
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
839,474 ÷ 771,954 = 1 + 67,520
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
771,954 ÷ 67,520 = 11 + 29,234
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
67,520 ÷ 29,234 = 2 + 9,052
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
29,234 ÷ 9,052 = 3 + 2,078
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
9,052 ÷ 2,078 = 4 + 740
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,078 ÷ 740 = 2 + 598
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
740 ÷ 598 = 1 + 142
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
598 ÷ 142 = 4 + 30
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
142 ÷ 30 = 4 + 22
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
30 ÷ 22 = 1 + 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 (999,999,999,896; 12,524,590) = 2
The two numbers have common prime factors