Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (999,999,999,916; 467,998) = ?
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,916 = 22 × 331 × 5,443 × 138,763
999,999,999,916 is not a prime number but a composite one.
467,998 = 2 × 211 × 1,109
467,998 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,916 ÷ 467,998 = 2,136,761 + 125,438
Step 2. Divide the smaller number by the above operation's remainder:
467,998 ÷ 125,438 = 3 + 91,684
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
125,438 ÷ 91,684 = 1 + 33,754
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
91,684 ÷ 33,754 = 2 + 24,176
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
33,754 ÷ 24,176 = 1 + 9,578
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
24,176 ÷ 9,578 = 2 + 5,020
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,578 ÷ 5,020 = 1 + 4,558
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,020 ÷ 4,558 = 1 + 462
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,558 ÷ 462 = 9 + 400
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
462 ÷ 400 = 1 + 62
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
400 ÷ 62 = 6 + 28
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
62 ÷ 28 = 2 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
28 ÷ 6 = 4 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 4 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
4 ÷ 2 = 2 + 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,916; 467,998) = 2
The two numbers have common prime factors