Self-Descriptive Number Checker

digit[i] counts occurrences of i

CalculatorsFreeNo Signup
4.5(674 reviews)
All Tools

Loading tool...

About Self-Descriptive Number Checker

A self-descriptive number checker testing if digit at position i equals the count of digit i in the number. Example: 2020 — digit 0 is 2 (two 0s), digit 1 is 0 (no 1s), digit 2 is 2 (two 2s), digit 3 is 0 (no 3s). Client-side.

Self-Descriptive Number Checker Features

  • Self-desc check
  • Digit analysis
  • All bases
  • Sequence
  • Explanation
Self-descriptive number: d-digit number where digit at position i (0-indexed) counts occurrences of digit i. Base 10: 6210001000 is the only one. Base 4: 1210, 2020. Base 5: 21200. Each base b≥4 has exactly one: (b−4)·b^(b−1) + 2·b^(b−2) + b^(b−3) + b^0.

How to Use

Enter number:

  • Self-desc?: Verify property
  • Analysis: Digit-by-digit check
  • Base: Try different bases

General Formula

In base b (b≥7): the unique self-descriptive number is (b−4)0...0210...001 — digit 0 is b−4, digit 1 is 2, digit 2 is 1, digit b−4 is 1, rest 0. For b=4,5,6: slightly different.

Related Concepts

  • Autobiographical numbers: same idea
  • Curious numbers: other self-referential properties
  • Look-and-say sequence: describes previous term

Step-by-Step Instructions

  1. 1Enter number.
  2. 2Check self-descriptive.
  3. 3See analysis.
  4. 4Try other bases.

Self-Descriptive Number Checker — Frequently Asked Questions

How many self-descriptive numbers exist?+

In base 10: exactly 1 (6210001000). Each base b≥4 has at least 1. Bases 2,3 have none. The uniqueness for b≥7 follows from a constructive argument showing the formula gives the only solution.

Why is 2020 self-descriptive in base 4?+

Position 0: digit is 2 (there are two 0s ✓). Position 1: digit is 0 (there are no 1s ✓). Position 2: digit is 2 (there are two 2s ✓). Position 3: digit is 0 (there are no 3s ✓). All positions match!

Are self-descriptive numbers related to fixed points?+

Yes! A self-descriptive number is a fixed point of the 'describe' function that maps n to the number whose digits count the occurrences of each digit in n. Finding these is related to fixed-point theory in combinatorics.

Share this tool: