17: All the proper, improper and prime factors (divisors) of number

Factors of number 17

17 is a prime number, it cannot be broken down to other prime factors. So, what are all the factors (divisors) of 17?

Prime numbers

Positive integers that are only dividing by themselves and 1 are called prime numbers.


A composite number is a positive integer that has at least one factor (divisor) other than 1 and itself.




17 has 2 factors: 1 and 17.
17 (some consider that 1 too) is an improper factor (divisor).

More operations of this kind:

Calculator: all the (common) factors (divisors) of numbers

Latest calculated factors (divisors)

factors (17) = ? May 18 14:50 UTC (GMT)
common factors (divisors) (1,960; 4,760) = ? May 18 14:49 UTC (GMT)
factors (2,427,983,416) = ? May 18 14:49 UTC (GMT)
factors (7,707,840) = ? May 18 14:49 UTC (GMT)
common factors (divisors) (4,827; 840) = ? May 18 14:49 UTC (GMT)
factors (7,432,560) = ? May 18 14:49 UTC (GMT)
common factors (divisors) (1,448,496; 2,896,992) = ? May 18 14:49 UTC (GMT)
common factors (divisors) (95; 152) = ? May 18 14:49 UTC (GMT)
factors (1,589,187,600) = ? May 18 14:49 UTC (GMT)
factors (941,340) = ? May 18 14:49 UTC (GMT)
factors (9,548,455) = ? May 18 14:49 UTC (GMT)
factors (6,937,056) = ? May 18 14:49 UTC (GMT)
factors (973,209,600) = ? May 18 14:49 UTC (GMT)
common factors (divisors), see more...

Tutoring: factors (divisors), common factors (common divisors), the greatest common factor, GCF (also called the greatest common divisor, GCD, or the highest common factor, HCF)

If "t" is a factor (divisor) of "a" then among the prime factors of "t" will appear only prime factors that also appear on the prime factorization of "a" and the maximum of their exponents (powers, or multiplicities) is at most equal to those involved in the prime factorization of "a".

For example, 12 is a factor (divisor) of 60:

  • 12 = 2 × 2 × 3 = 22 × 3
  • 60 = 2 × 2 × 3 × 5 = 22 × 3 × 5

If "t" is a common factor (divisor) of "a" and "b", then the prime factorization of "t" contains only the common prime factors involved in both the prime factorizations of "a" and "b", by lower or at most by equal powers (exponents, or multiplicities).

For example, 12 is the common factor of 48 and 360. After running both numbers' prime factorizations (factoring them down to prime factors):

  • 12 = 22 × 3;
  • 48 = 24 × 3;
  • 360 = 23 × 32 × 5;
  • Please note that 48 and 360 have more factors (divisors): 2, 3, 4, 6, 8, 12, 24. Among them, 24 is the greatest common factor, GCF (or the greatest common divisor, GCD, or the highest common factor, HCF) of 48 and 360.

The greatest common factor, GCF, is the product of all prime factors involved in both the prime factorizations of "a" and "b", by the lowest powers (multiplicities).

Based on this rule it is calculated the greatest common factor, GCF, (or greatest common divisor GCD, HCF) of several numbers, as shown in the example below:

  • 1,260 = 22 × 32;
  • 3,024 = 24 × 32 × 7;
  • 5,544 = 23 × 32 × 7 × 11;
  • Common prime factors are: 2 - its lowest power (multiplicity) is min.(2; 3; 4) = 2; 3 - its lowest power (multiplicity) is min.(2; 2; 2) = 2;
  • GCF, GCD (1,260; 3,024; 5,544) = 22 × 32 = 252;

If two numbers "a" and "b" have no other common factors (divisors) than 1, gfc, gcd, hcf (a; b) = 1, then the numbers "a" and "b" are called coprime (or relatively prime).

If "a" and "b" are not coprime, then every common factor (divisor) of "a" and "b" is a also a factor (divisor) of the greatest common factor, GCF (greatest common divisor, GCD, highest common factor, HCF) of "a" and "b".


What is a prime number?

What is a composite number?

Prime numbers up to 1,000

Prime numbers up to 10,000

Sieve of Eratosthenes

Euclid's algorithm

Simplifying ordinary (common) math fractions (reducing to lower terms): steps to follow and examples