Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (13,741,670; 38,957,798,944) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
13,741,670 = 2 × 5 × 587 × 2,341
13,741,670 is not a prime number but a composite one.
38,957,798,944 = 25 × 17 × 71,613,601
38,957,798,944 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:
38,957,798,944 ÷ 13,741,670 = 2,835 + 164,494
Step 2. Divide the smaller number by the above operation's remainder:
13,741,670 ÷ 164,494 = 83 + 88,668
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
164,494 ÷ 88,668 = 1 + 75,826
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
88,668 ÷ 75,826 = 1 + 12,842
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
75,826 ÷ 12,842 = 5 + 11,616
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
12,842 ÷ 11,616 = 1 + 1,226
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
11,616 ÷ 1,226 = 9 + 582
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,226 ÷ 582 = 2 + 62
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
582 ÷ 62 = 9 + 24
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
62 ÷ 24 = 2 + 14
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
24 ÷ 14 = 1 + 10
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
14 ÷ 10 = 1 + 4
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
10 ÷ 4 = 2 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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 (13,741,670; 38,957,798,944) = 2
The two numbers have common prime factors