Among the countless numbers that populate mathematics, few possess the strange, almost hypnotic quality of 6174. At first glance it appears ordinary — just another four-digit integer sitting quietly between 6173 and 6175. Yet this unassuming number is the destination of a remarkable iterative process known as Kaprekar’s routine. No matter which four-digit number you begin with (provided it is not composed of four identical digits), a simple sequence of rearranging digits and subtracting will inevitably lead you to 6174, usually within just a few steps, and never more than seven. Once there, the process locks onto 6174 forever. This fixed point is known as Kaprekar’s constant, named after the Indian recreational mathematician who first brought it to light.
The phenomenon feels almost magical, yet it is entirely deterministic and rooted in the finite nature of four-digit numbers. In this article we will explore the history of its discovery, the precise rules of the routine, multiple worked examples, the mathematical reasons behind its convergence, related constants in other digit lengths, and the lasting cultural impact of this curious number.
Dattatreya Ramchandra Kaprekar was born on 17 January 1905 in Dahanu, Maharashtra, India. He received his bachelor’s degree from the University of Mumbai (then Bombay University) in 1929 and spent his entire working life as a schoolteacher at the government junior school in Devlali, near Nashik. He never held a university research post and worked largely in isolation, yet he possessed an extraordinary gift for noticing patterns in ordinary numbers.
Kaprekar discovered the property of 6174 around 1946 and announced it at the Madras Mathematical Conference in 1949. He later published related results in the paper “Problems Involving Reversal of Digits” in Scripta Mathematica in 1953. For decades his work remained relatively obscure outside recreational mathematics circles. Wider recognition arrived in 1975 when the celebrated American science writer Martin Gardner featured Kaprekar’s discoveries in his popular “Mathematical Games” column in Scientific American. From that moment the “ghost number” 6174 entered the global mathematical imagination.
Kaprekar also introduced several other classes of numbers that still bear his name: Kaprekar numbers (numbers whose square can be split into two parts that add up to the original number), self-numbers (or Devlali numbers), and Harshad numbers. He once compared his passion for numbers to a drunkard’s craving for wine, saying he needed to keep working with them to remain in that pleasurable state. He died on 4 July 1986, leaving behind a body of work that continues to delight both amateur and professional mathematicians.
The process is deceptively simple:
Choose any four-digit number that is not a repdigit (not all four digits the same). Leading zeros are permitted when forming the smaller number.
Rearrange the digits to form the largest possible number.
Rearrange the same digits to form the smallest possible number.
Subtract the smaller number from the larger one.
Take the result and repeat the process.
Every valid starting number will reach 6174 in at most seven iterations. Once 6174 is obtained, the next step yields:
7641 − 1467 = 6174
The number has become a fixed point of the mapping.
Example 1 — Starting with 3524 (three steps)
5432 − 2345 = 3087
8730 − 0378 = 8352
8532 − 2358 = 6174
Example 2 — Starting with 9218 (two steps)
9821 − 1289 = 8532
8532 − 2358 = 6174
Example 3 — Starting with 2011 (four steps)
2110 − 0112 = 1998
9981 − 1899 = 8082
8820 − 0288 = 8532
8532 − 2358 = 6174
Example 4 — A longer path, starting with 3743 (seven steps)
7433 − 3347 = 4086
8640 − 0468 = 8172
8721 − 1278 = 7443
7443 − 3447 = 3996
9963 − 3699 = 6264
6642 − 2466 = 4176
7641 − 1467 = 6174
Notice that even when the intermediate results drop below four digits, we treat them as four-digit numbers by padding with leading zeros. This keeps the process consistent.
The set of four-digit numbers is finite — there are exactly 9000 numbers from 1000 to 9999. When we include numbers with leading zeros (0000 to 9999), the total space is 10 000. Of these, the nine pure repdigits (0000, 1111, …, 9999) map immediately to zero and stay there. For all other numbers the Kaprekar map is a well-defined function that sends each number to another number in the same finite set.
Because the set is finite, every trajectory must eventually enter a cycle or a fixed point. Exhaustive computation has shown that the only non-trivial fixed point reachable from numbers with at least two distinct digits is 6174, and that no longer cycles exist for four-digit numbers. The maximum number of steps required is seven; most numbers reach the constant in three to five steps.
An important modular property helps explain the behaviour: the largest and smallest rearrangements of a number have the same digit sum and are therefore congruent modulo 9. Their difference is therefore always a multiple of 9. Consequently every term in a Kaprekar sequence after the first is divisible by 9. This restricts the possible values considerably and contributes to the rapid convergence.
There is no simple closed-form algebraic proof that avoids case analysis or computation, but the exhaustive verification for all 9000 candidates leaves no doubt about the result.
Kaprekar’s routine works for other digit lengths as well. For three-digit numbers the corresponding constant is 495. Starting with any three-digit number that is not a repdigit and applying the same largest-minus-smallest process leads to 495 in at most six steps. For example:
853 − 358 = 495
954 − 459 = 495
For two-digit numbers the process eventually reaches zero or enters short cycles. For five-digit and higher numbers the picture becomes more complex: instead of a single fixed point one typically encounters several fixed points or short cycles. Thus 6174 and 495 occupy a privileged position as the only non-trivial Kaprekar constants for base-10 numbers of small fixed length.
Since Martin Gardner’s 1975 article, 6174 has become a staple of recreational mathematics. It appears in puzzle books, classroom activities, programming exercises, and viral social-media posts. Teachers use it to introduce the ideas of iteration, fixed points, and the power of systematic exploration. Computer scientists employ it as a simple example when teaching algorithms and state-space search. Artists and designers have even incorporated the number into visual works that illustrate the convergence of many starting points onto a single attractor.
The story of Kaprekar himself adds human depth. Here was a modest schoolteacher working without institutional support or modern computing tools, yet he uncovered a deep and beautiful regularity that professional mathematicians had overlooked. His discovery reminds us that profound insights can arise from patient, playful engagement with the most elementary objects — the natural numbers themselves.
6174 stands as a quiet monument to the hidden order that can lurk inside ordinary arithmetic. The Kaprekar routine is easy enough for a child to perform yet deep enough to reward serious mathematical investigation. It demonstrates that a finite system of simple rules can produce a single powerful attractor that draws almost every starting point toward itself.
The next time you encounter a four-digit number — a year, a PIN, a house number — try applying the routine. Within a handful of steps you will almost certainly arrive at 6174, the number that refuses to leave once it has been found. In that small calculation you will be repeating a process first noticed by a schoolteacher in Devlali more than seventy years ago, and you will experience one of the purest delights mathematics has to offer: the sudden recognition of unexpected order.
Kaprekar’s constant remains a perfect example of recreational mathematics at its best — accessible, surprising, and endlessly charming.