Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Purely out of curiosity, is there a name for a positive integer that has at most a given number of distinct prime factors?

Suppose a positive integer $n$ has at most $k$ distinct prime factors. The best word I can think of for this is, perhaps, 'simple,' since at least for small $k$ the prime factorization of a $k$-simple number will not be difficult to write out - that is, will not be a long string of distinct primes. A $2$-simple number will have prime factorization $p^aq^b$ for $p$ and $q$ distinct primes and $a,b \in \mathbb{Z}^+$, a $3$-simple number will be $p^aq^br^c$, and so on.

So for example, $100=2^2\cdot 5^2$ is $2$-simple, $30=2\cdot 3\cdot 5$ is $3$-simple, and $210=2\cdot 3 \cdot 5 \cdot 7$ is $4$-simple. Clearly a number is $1$-simple if and only if it is a prime power.

Is there such a term commonly in use?

share|improve this question
Supported at $k$ primes? –  jspecter Jan 30 '13 at 4:57
Related: en.wikipedia.org/wiki/Almost_prime –  Brett Frankel Jan 30 '13 at 4:58

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.