What is the Greatest Common Factor of 128 and 145?

Greatest common factor (GCF) of 128 and 145 is 1.

GCF(128,145) = 1

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

How to find the GCF of 128 and 145?

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

Step-1: Prime Factorization of 128

Prime factors of 128 are 2. Prime factorization of 128 in exponential form is:

128 = 2⁷

Step-2: Prime Factorization of 145

Prime factors of 145 are 5, 29. Prime factorization of 145 in exponential form is:

145 = 5¹ × 29¹

Step-3: Factors of 128

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

1, 2, 4, 8, 16, 32, 64

Step-4: Factors of 145

List of positive integer factors of 145 that divides 128 without a remainder.

1, 5, 29

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 128 and 145