5,456,565,694 and 6,766,726 are not relatively prime... if:
- If there is at least one number other than 1 that evenly divides the two numbers (without a remainder). Or...
- Or, in other words, if their greatest (highest) common factor (divisor), gcf (hcf, gcd), is not equal to 1.
Calculate the greatest (highest) common factor (divisor),
gcf (hcf, gcd), of the two numbers
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,456,565,694 = 2 × 2,728,282,847
5,456,565,694 is not a prime number, is a composite one.
6,766,726 = 2 × 71 × 47,653
6,766,726 is not a prime number, is a composite one.
- Prime number: a number that is divisible (dividing evenly) only by 1 and itself. A prime number has only 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), gcf (hcf, gcd):
Multiply all the common prime factors of the two numbers, taken by their smallest exponents (powers).
Step 1. Divide the larger number by the smaller one:
5,456,565,694 ÷ 6,766,726 = 806 + 2,584,538
Step 2. Divide the smaller number by the above operation's remainder:
6,766,726 ÷ 2,584,538 = 2 + 1,597,650
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
2,584,538 ÷ 1,597,650 = 1 + 986,888
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
1,597,650 ÷ 986,888 = 1 + 610,762
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
986,888 ÷ 610,762 = 1 + 376,126
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
610,762 ÷ 376,126 = 1 + 234,636
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
376,126 ÷ 234,636 = 1 + 141,490
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
234,636 ÷ 141,490 = 1 + 93,146
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
141,490 ÷ 93,146 = 1 + 48,344
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
93,146 ÷ 48,344 = 1 + 44,802
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
48,344 ÷ 44,802 = 1 + 3,542
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
44,802 ÷ 3,542 = 12 + 2,298
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
3,542 ÷ 2,298 = 1 + 1,244
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
2,298 ÷ 1,244 = 1 + 1,054
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
1,244 ÷ 1,054 = 1 + 190
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
1,054 ÷ 190 = 5 + 104
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
190 ÷ 104 = 1 + 86
Step 18. Divide the remainder of the step 16 by the remainder of the step 17:
104 ÷ 86 = 1 + 18
Step 19. Divide the remainder of the step 17 by the remainder of the step 18:
86 ÷ 18 = 4 + 14
Step 20. Divide the remainder of the step 18 by the remainder of the step 19:
18 ÷ 14 = 1 + 4
Step 21. Divide the remainder of the step 19 by the remainder of the step 20:
14 ÷ 4 = 3 + 2
Step 22. Divide the remainder of the step 20 by the remainder of the step 21:
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).
gcf (hcf, gcd) (5,456,565,694; 6,766,726) = 2 ≠ 1
Are the numbers 5,456,565,694 and 6,766,726 coprime (prime to each other, relatively prime)? No, they are not.
gcf (hcf, gcd) (6,766,726; 5,456,565,694) = 2 ≠ 1