What is the Greatest Common Factor of 1495 and 1502?

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

GCF(1495,1502) = 1

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

How to find the GCF of 1495 and 1502?

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

Step-1: 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-2: Prime Factorization of 1502

Prime factors of 1502 are 2, 751. Prime factorization of 1502 in exponential form is:

1502 = 2¹ × 751¹

Step-3: Factors of 1495

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

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

Step-4: Factors of 1502

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

1, 2, 751

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1495 and 1502