Achilles number Created 2026-10-20 Updated 2026-11-05
An Achilles number is a powerful number greater than one that is not a perfect power. In its prime factorizationevery prime exponent satisfies , and . The first condition is precisely the definition of a powerful number. For the second, with integers exactly when divides every prime exponent; hence a greatest common divisor greater than one is precisely the obstruction.
For example, is an Achilles number because . By contrast, is powerful but is a perfect square, so it is not an Achilles number.
Cube-full number Created 2026-10-20 Updated 2026-11-05
A cube-full number is a positive integer whose every occurring prime factor has prime exponent at least three. Equivalently, if a prime number divides , then divides . Examples are , and . The number fails because its factor three occurs only twice. The number is included, since it has no prime factors violating the condition.
Every cube-full number is a powerful number, but the converse fails: is powerful without being cube-full. Being cube-full also differs from being a perfect cube; the exponents need only be at least three, rather than multiples of three. Thus is cube-full but not a perfect cube.
Sqube Created 2026-10-20 Updated 2026-11-05
A sqube is a positive integer for distinct prime numbers . The ordering matters: , whereas . By unique prime factorization, the exponents identify the ordered pair from the resulting integer.
Every sqube is an Achilles number. It is a powerful number, because both prime exponents are at least two. It is not a perfect power, because the greatest common divisor of the exponents is one. This connects the square-cube construction to two general factorization classes.