Skip to content

Achilles Number

A positive integer that is powerful because every prime exponent is at least two, yet is not a perfect power because those exponents have greatest common divisor one.

Version
v1 · 2026-09-28 · History
Domain-specific #
7851
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomains
Elementary Number Theory, Recreational Mathematics → Mathematics

Core Idea

Achilles numbers combine strength and imperfection in prime-exponent form. If n=∏p_i^{a_i}, every a_i must be at least two, so n is powerful; at the same time gcd(a_i)=1, so no exponent k>1 can be factored from all powers.

The two tests are independent and exact. Strong Achilles numbers add a further condition on Euler’s totient, but that subtype should not be folded into ordinary membership.

How would you explain it like I'm…

Strong Numbers With a Weak Spot

Every number can be broken into building-block numbers multiplied together, like 72 = 2 × 2 × 2 × 3 × 3. An Achilles number is one where every building block shows up at least twice, which makes it strong. But you still can't make it by multiplying one number by itself, like 6 × 6 or 2 × 2 × 2. Like the hero Achilles, it's strong but not perfect.

Powerful but Not a Power

Every whole number can be broken into prime numbers multiplied together. An Achilles number passes two tests. First, every prime in it shows up at least twice - numbers like that are called powerful. Second, it isn't a perfect power, meaning you can't get it by multiplying some smaller whole number by itself two or more times. For example, 72 is 2 x 2 x 2 x 3 x 3, so it's powerful, and it isn't a square or a cube or any other perfect power, so it's an Achilles number. But 36 is 6 x 6, so even though it's powerful, it's not one.

Powerful Non-Perfect-Power Numbers

Write a number as a product of primes, n = p1^a1 x p2^a2 x ... An Achilles number meets two separate conditions on those exponents. First, every exponent is at least 2, which makes n a powerful number. Second, the exponents have no common factor bigger than 1 (their greatest common divisor is 1), which means n is not a perfect power - there's no single exponent k greater than 1 you could pull out of all of them to write n as m^k. So 72 = 2^3 x 3^2 qualifies, while 36 = 2^2 x 3^2 = 6^2 does not. The two tests are independent: a number can pass one and fail the other. There's also a stricter subtype, strong Achilles numbers, which adds a condition involving Euler's totient function, but that is not part of the ordinary definition.

 

An Achilles number is a positive integer that is powerful but not a perfect power, a combination of 'strength' and 'imperfection' read directly off its prime factorization. If n = product of p_i^{a_i}, then n is powerful when every a_i is at least 2, and n is not a perfect power when gcd(a_i) = 1, since a common divisor k > 1 of all exponents would let n be written as m^k. Both tests are exact and logically independent: 36 = 2^2 x 3^2 is powerful but a perfect square, while 12 = 2^2 x 3 has coprime exponents but is not powerful. 72 = 2^3 x 3^2 satisfies both and is an Achilles number. Strong Achilles numbers impose a further condition involving Euler's totient function, and that subtype should be kept separate from ordinary membership.

Structural Signature

Sig role-phrases:

  • Positive integer n — Is the object classified. It is carrier. Counterfactual: Zero, negative sign conventions, and nonintegers are outside the standard sequence.
  • Prime factorization — Provides unique primes and positive exponents. It is representation. Counterfactual: Decimal appearance cannot establish membership.
  • Exponent floor — Requires every exponent at least two. It is powerful test. Counterfactual: Any exponent one immediately rejects n.
  • Exponent gcd — Tests whether all exponents share a factor greater than one. It is perfect power test. Counterfactual: Pairwise variation alone does not exclude a common divisor.
  • Conjunction — Combines powerful status with failure of perfect-power status. It is defining logic. Counterfactual: Satisfying either condition alone is insufficient.
  • Totient extension — Defines the strong subtype only after n qualifies. It is subtype test. Counterfactual: It is not part of ordinary Achilles membership.

What It Is Not

  • It is not every powerful number.
  • It is not a perfect power.
  • A composite with any prime exponent one fails.
  • Strong Achilles is a stricter subtype.
  • Closest near-miss. Every perfect power with exponents at least two is powerful, but Achilles numbers are precisely the powerful cases whose exponent vector is primitive under gcd.

Scope of Application

  • Number theory. Studies multiplicative integer classes.
  • Integer sequences. Enumerates and estimates occurrence.
  • Factorization algorithms. Tests exponent patterns.
  • Recreational mathematics. Uses the Achilles naming analogy.

Clarity

State positive-integer convention, complete prime factorization, all exponents, minimum exponent, exponent gcd, perfect-power conclusion, and whether the strong totient condition is being tested.

Manages Complexity

Membership is a concise conjunction of a coordinatewise lower bound and a global gcd condition on the unique exponent vector.

Abstract Reasoning

  1. Factor n completely.
  2. Reject if any exponent is below two.
  3. Compute the gcd of all exponents.
  4. Accept exactly when that gcd is one.
  5. For strong status, factor and test φ(n) separately.

Knowledge Transfer

The criterion transfers directly to exact prime factorizations, but probabilistic or partial factorization cannot certify membership unless missing factors and exponents are controlled.

Examples

Canonical

108=2²·3³ has exponents 2 and 3: both meet the floor and gcd(2,3)=1, so it is Achilles.

Mapped back: integer → 108; factorization → 2²·3³; floor → met; gcd → 1; verdict → Achilles.

Applied / In Practice

784=2⁴·7² is powerful but gcd(4,2)=2, so 784=28² and is not Achilles.

Mapped back: floor → met; gcd → 2; perfect power → yes.

Structural Tensions

T1 — Local Exponent Condition versus Global Common Power. Powerfulness checks each exponent separately, while perfect-power status depends on their collective gcd.

Diagnostic: Were both tests performed?

T2 — Ordinary Class versus Strong Subtype. Totient recursion creates a narrower sequence that can be mistakenly built into the base definition.

Diagnostic: Is φ(n) being tested only for the named subtype?

Structural–Framed Character

Achilles Number is structural as a prime-exponent predicate.

Structural Core vs. Domain Accent

The core is unique factorization, exponent floor, and exponent gcd. Number theory supplies powerful numbers, perfect powers, totients, and sequence questions.

This entry presupposes Classification.

  • Approved root. No reviewed parent entails this integer class.

  • Related — powerful number, perfect power, prime factorization, exponent gcd, and Euler totient. They provide superset, exclusion, representation, test, and subtype.

Relationships to Other Abstractions

Local relationship map for Achilles NumberParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Achilles NumberDOMAINPrime abstraction: Classification — presupposesClassificationPRIME

Current abstraction Achilles Number Domain-specific

Parents (1) — more general patterns this builds on

  • Achilles Number presupposes Classification Prime

    Achilles Number presupposes Classification because membership is determined by a rule over prime exponents: all at least two with greatest common divisor one.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Achilles Number sits in a crowded region of the domain-specific corpus (27th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Number & Formal Language Properties (7 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With

  • Powerful number. Tell: May also be a perfect power.
  • Perfect power. Tell: Has exponent gcd greater than one.
  • Squareful number. Tell: Is commonly synonymous with powerful, hence broader.
  • Strong Achilles number. Tell: Also requires φ(n) to be Achilles.

References

  • Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Achilles_number (revision 1361214530).
  • Preserved source candidate: https://projecteuler.net/problem=302
  • Preserved source candidate: https://www.primepuzzles.net/problems/prob_053.htm

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.