What is the Greatest Common Factor of 1478 and 1495?

Greatest common factor (GCF) of 1478 and 1495 is 1.

GCF(1478,1495) = 1

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

How to find the GCF of 1478 and 1495?

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

Step-1: Prime Factorization of 1478

Prime factors of 1478 are 2, 739. Prime factorization of 1478 in exponential form is:

1478 = 2¹ × 739¹

Step-2: Prime Factorization of 1495

Prime factors of 1495 are 5, 13, 23. Prime factorization of 1495 in exponential form is:

1495 = 5¹ × 13¹ × 23¹

Step-3: Factors of 1478

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

1, 2, 739

Step-4: Factors of 1495

List of positive integer factors of 1495 that divides 1478 without a remainder.

1, 5, 13, 23, 65, 115, 299

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1478 and 1495