Kaprekar Number Checker
Check whether a positive integer's square splits into a left part and a right part of the same digit count that sum back to the integer.
Description
Check whether a positive integer's square splits into a left part and a right part of the same digit count that sum back to the integer.
Check whether a positive integer's square splits into a left part and a right part of the same digit count that sum back to the integer.
When to use Kaprekar Number Checker
Use this tool to test or transform exact integers according to the named number-theory definition, for education, validation, or algorithm checks.
- Integer
- At most the largest integer whose square stays within the safe integer range.
How the calculation works
The formula below determines the tool output. Is a Kaprekar number: Whether is a kaprekar number is true.1
split n² into L and R; n is Kaprekar when R > 0 and L + R = n Limitations and assumptions
This tool applies an exact integer definition within JavaScript's safe-integer range. It is not an arbitrary-precision factorization or proof system, so do not use rounded measurements or integers beyond the accepted domain as though they were exact.
Alternative or Complementary approaches
Complement a number-property result with its factorization, divisors, digit representation, or a second independent predicate. A true result establishes only the named property and does not imply other properties such as primality.
References
-
Kaprekar number — Wikipedia contributors
Similar or alternative tools
- Armstrong Number Checker
Check whether a nonnegative integer equals the sum of its digits each raised to the digit count.
- Automorphic Number Checker
Check whether the square of a nonnegative integer ends with the integer itself.
- Digit Count Calculator
Count the base-10 digits in a safe integer without counting its sign.