Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (2,500,096; 39,999,999,979) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
2,500,096 = 29 × 19 × 257
2,500,096 is not a prime number but a composite one.
39,999,999,979 is a prime number and cannot be broken down into other prime factors.
- 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).
But the two numbers have no common prime factors.
Step 1. Divide the larger number by the smaller one:
39,999,999,979 ÷ 2,500,096 = 15,999 + 964,075
Step 2. Divide the smaller number by the above operation's remainder:
2,500,096 ÷ 964,075 = 2 + 571,946
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
964,075 ÷ 571,946 = 1 + 392,129
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
571,946 ÷ 392,129 = 1 + 179,817
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
392,129 ÷ 179,817 = 2 + 32,495
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
179,817 ÷ 32,495 = 5 + 17,342
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
32,495 ÷ 17,342 = 1 + 15,153
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
17,342 ÷ 15,153 = 1 + 2,189
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
15,153 ÷ 2,189 = 6 + 2,019
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,189 ÷ 2,019 = 1 + 170
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
2,019 ÷ 170 = 11 + 149
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
170 ÷ 149 = 1 + 21
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
149 ÷ 21 = 7 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
21 ÷ 2 = 10 + 1
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
2 ÷ 1 = 2 + 0
At this step, the remainder is zero, so we stop:
1 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 (2,500,096; 39,999,999,979) = 1
Coprime numbers (prime to each other, relatively prime).
The two numbers have no prime factors in common