Square-Free Number Checker

About this calculator

An integer is square-free when no perfect square greater than 1 divides it evenly — equivalently, when every prime in its factorization appears with exponent exactly 1. So 10 = 2 × 5 is square-free, but 12 = 2² × 3 is not, because 4 divides it. The calculator finds the full prime factorization and checks whether any prime repeats to answer the question directly.

Square-free numbers show up throughout number theory rather than everyday arithmetic: the Möbius function μ(n), central to inclusion-exclusion arguments and the study of the Riemann zeta function, is defined to be zero exactly when n is not square-free, and nonzero (±1) exactly when it is. Square-free counting also appears in problems about simplifying square roots — √n reduces to an integer times an irrational only when n itself is not square-free — and in recreational and olympiad-style number theory, where testing square-freeness is a common warm-up step before harder factorization problems.

Enter any positive integer and the calculator reports whether it is square-free, alongside its prime factorization so you can see exactly which prime, if any, is repeated.