A repdigit is a number every one of whose digits is identical — 111, made of three 1's, is the smallest three-digit repdigit built entirely from ones, and it belongs to a small, easily overlooked family of numbers (11, 111, 1111, 11111...) called repunits, meaning "repeated units," each one formed purely from the digit 1.
Repunits carry a specific mathematical elegance worth understanding rather than just noting. In base 10, the n-digit repunit can be written as (10ⁿ − 1) ÷ 9 — for 111 specifically, (10³ − 1) ÷ 9 = 999 ÷ 9 = 111, a clean formula connecting the repeated-digit pattern to a straightforward relationship with powers of 10. This formula generalizes to any repunit length, which is part of why repunits are studied as their own distinct object in recreational and research number theory rather than being dismissed as a mere visual curiosity.
111's own factorization is 3 × 37 — a fact worth pausing on, since it illustrates something genuinely useful about repunits generally: despite 111 looking deceptively simple, it is not prime, and in fact very few repunits are prime at all. Repunit primes (values in the sequence 11, 111, 1111... that are themselves prime) are strikingly rare — 11 (the two-digit repunit) is prime, but 111 is not, nor is 1111 (=11×101), and the search for repunit primes of any significant length is an active area of computational number theory, since testing extremely long repunits for primality requires serious computational effort even with modern methods.
Beyond pure number theory, 111 and other repdigits (222, 333, and so on through 999, plus longer patterns like 1111) have taken on a specific, widely recognized cultural meaning in recent decades within numerology and "angel number" traditions — repeating-digit sequences appearing on clocks, receipts, or license plates are popularly interpreted within these traditions as meaningful signals or messages, a belief system distinct from, and not derived from, mathematical number theory itself. This site focuses on the checkable mathematical properties of numbers like 111 rather than numerological interpretation, but readers specifically interested in the angel-number and numerology reading of repeating digit sequences like 111 can find that covered in depth on our sister site NumberAngel, which specializes in that adjacent territory.
Repdigits more broadly (not just repunits) are a useful entry point into pattern recognition in number theory generally — noticing that a number's digits repeat is often the first step toward investigating whether it has other structural properties, like being a palindrome (which every repdigit trivially is, since it reads the same forwards and backwards) or having an unusually simple factorization pattern, as 111's clean 3×37 breakdown demonstrates.
It's worth being precise about the difference between a repdigit and a palindrome, since the two concepts are related but not identical: every repdigit is automatically a palindrome (since a string of identical digits obviously reads the same forwards and backwards), but not every palindrome is a repdigit — 121 and 12321 are palindromes without being repdigits, since their digits aren't all the same. 111 happens to satisfy both categories simultaneously, which is part of why it's such a clean, approachable first example when introducing either concept to someone encountering them for the first time.
The broader family of repunits also connects, somewhat unexpectedly, to a well-known piece of recreational arithmetic involving 142857, the cyclic number covered elsewhere on this site: multiplying 111,111 (a six-digit repunit) by 9 produces 999,999, and dividing 999,999 by 7 gives exactly 142,857 — a chain of relationships between repunits, cyclic numbers, and the number 7's own repeating-decimal behavior that rewards a bit of hands-on exploration for anyone genuinely curious about how these small numeric families interconnect.
Longer repunits beyond 111 quickly become impractical to factor by hand, and the search for repunit primes specifically has become a genuinely active area of distributed and specialized computational number theory, with confirmed repunit primes known at only a handful of specific lengths despite extensive searching across vastly longer candidates — a modest but real research frontier hiding behind what looks, at a glance, like the simplest possible number pattern.
This is precisely why 111 makes such a good introductory example within this broader family: small enough to fully factor and verify by hand, yet a genuine doorway into a family of numbers whose larger members remain a live subject of computational research rather than a fully solved, closed chapter of elementary number theory.