Automorphic Number Checker
Check whether a number is an automorphic number using this fast and simple checker.
Share
https://www.solvezi.com/number-theory/automorphic-number-checker
Check whether a number is an automorphic number using this fast and simple checker.
https://www.solvezi.com/number-theory/automorphic-number-checker
Click an example to try:
An automorphic number (also called a circular number) is a number whose square ends with the number itself.
For example, 5 is automorphic because 5² = 25 (ends with 5), 6² = 36 (ends with 6), and 25² = 625 (ends with 25).
A number n is automorphic if: n² ≡ n (mod 10ᵏ) where k is the number of digits in n.
25² = 625
Automorphic numbers only end with 0, 1, 5, or 6.
Automorphic numbers form two infinite sequences.
Each automorphic number is a suffix of the next.
1Square calculation:
2Verification:
1Square calculation:
2Verification:
1Square calculation:
2Verification:
1Square calculation:
2Verification:
| Number | Square | Digits | Note |
|---|---|---|---|
| 0 | 0 | 1 | Zero is automorphic |
| 1 | 1 | 1 | One is automorphic |
| 5 | 25 | 1 | Smallest odd automorphic |
| 6 | 36 | 1 | Smallest even automorphic |
| 25 | 625 | 2 | Two-digit automorphic |
| 76 | 5,776 | 2 | 76² ends with 76 |
| 376 | 141,376 | 3 | Three-digit automorphic |
| 625 | 390,625 | 3 | 625² ends with 625 |
| 9376 | 87,909,376 | 4 | Four-digit automorphic |
| 90625 | 8,212,890,625 | 5 | Five-digit automorphic |
There are infinitely many automorphic numbers, each larger than the previous!
| Property | Description | Example |
|---|---|---|
| Infinite Sequence | Infinitely many automorphic numbers exist | 5, 25, 625, 90625... |
| Ending Patterns | Ending digits are always 0, 1, 5, or 6 | 376 ends with 6, 625 ends with 5 |
| Nested Property | Each is a suffix of the next | 5 → 25 → 625 → 0625 |
| Base Dependence | Depends on the number base | Different in base 8, base 16 |
| Idempotent Connection | Related to idempotent elements modulo 10^k | n² ≡ n (mod 10^k) |
| Two Sequences | 5-ending and 6-ending series | 5, 25, 625... and 6, 76, 376... |
n² ≡ n (mod 10ᵏ)
Where k is the number of digits in n, and n² mod 10ᵏ = n