What is the Greatest Common Factor of 1552 and 1565?

Greatest common factor (GCF) of 1552 and 1565 is 1.

GCF(1552,1565) = 1

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

How to find the GCF of 1552 and 1565?

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

Step-1: Prime Factorization of 1552

Prime factors of 1552 are 2, 97. Prime factorization of 1552 in exponential form is:

1552 = 2⁴ × 97¹

Step-2: Prime Factorization of 1565

Prime factors of 1565 are 5, 313. Prime factorization of 1565 in exponential form is:

1565 = 5¹ × 313¹

Step-3: Factors of 1552

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

1, 2, 4, 8, 16, 97, 194, 388, 776

Step-4: Factors of 1565

List of positive integer factors of 1565 that divides 1552 without a remainder.

1, 5, 313

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1552 and 1565