What is the Greatest Common Factor of 4895 and 4913?

Greatest common factor (GCF) of 4895 and 4913 is 1.

GCF(4895,4913) = 1

We will now calculate the prime factors of 4895 and 4913, than find the greatest common factor (greatest common divisor (gcd)) of the numbers by matching the biggest common factor of 4895 and 4913.

How to find the GCF of 4895 and 4913?

We will first find the prime factorization of 4895 and 4913. After we will calculate the factors of 4895 and 4913 and find the biggest common factor number .

Step-1: Prime Factorization of 4895

Prime factors of 4895 are 5, 11, 89. Prime factorization of 4895 in exponential form is:

4895 = 5¹ × 11¹ × 89¹

Step-2: Prime Factorization of 4913

Prime factors of 4913 are 17. Prime factorization of 4913 in exponential form is:

4913 = 17³

Step-3: Factors of 4895

List of positive integer factors of 4895 that divides 4895 without a remainder.

1, 5, 11, 55, 89, 445, 979

Step-4: Factors of 4913

List of positive integer factors of 4913 that divides 4895 without a remainder.

1, 17, 289

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 4895 and 4913. The biggest common factor number is the GCF number.
So the greatest common factor 4895 and 4913 is 1.

Also check out the Least Common Multiple of 4895 and 4913