For example, in base 10, the number 6210001000 is self-descriptive because of the following reasons:

In base 10, the number has 10 digits, indicating its base;
It contains 6 at position 0, indicating that there are six 0s in 6210001000;
It contains 2 at position 1, indicating that there are two 1s in 6210001000;
It contains 1 at position 2, indicating that there is one 2 in 6210001000;
It contains 0 at position 3, indicating that there is no 3 in 6210001000;
It contains 0 at position 4, indicating that there is no 4 in 6210001000;
It contains 0 at position 5, indicating that there is no 5 in 6210001000;
It contains 1 at position 6, indicating that there is one 6 in 6210001000;
It contains 0 at position 7, indicating that there is no 7 in 6210001000;
It contains 0 at position 8, indicating that there is no 8 in 6210001000;
It contains 0 at position 9, indicating that there is no 9 in 6210001000.

There are no self-descriptive numbers in bases 2, 3 or 6. In bases 7 and greater, there is exactly one self-descriptive number: ${\displaystyle (b-4)b^{b-1}+2b^{b-2}+b^{b-3}+b^{3}}$ , which has b−4 instances of the digit 0, two instances of the digit 1, one instance of the digit 2, one instance of digit b – 4, and no instances of any other digits. The following table lists some self-descriptive numbers in a few selected bases:

From the numbers listed in the table, it would seem that all self-descriptive numbers have digit sums equal to their base, and that they're multiples of that base. The first fact follows trivially from the fact that the digit sum equals the total number of digits, which is equal to the base, from the definition of self-descriptive number.

That a self-descriptive number in base b must be a multiple of that base (or equivalently, that the last digit of the self-descriptive number must be 0) can be proven by contradiction as follows: assume that there is in fact a self-descriptive number m in base b that is b-digits long but not a multiple of b. The digit at position b – 1 must be at least 1, meaning that there is at least one instance of the digit b – 1 in m. At whatever position x that digit b – 1 falls, there must be at least b – 1 instances of digit x in m. Therefore, we have at least one instance of the digit 1, and b – 1 instances of x. If x > 1, then m has more than b digits, leading to a contradiction of our initial statement. And if x = 0 or 1, that also leads to a contradiction.

It follows that a self-descriptive number in base b is a Harshad number in base b.

A generalization of the self-descriptive numbers, called the autobiographical numbers, allow fewer digits than the base, as long as the digits that are included in the number suffice to completely describe it. e.g. in base 10, 3211000 has 3 zeros, 2 ones, 1 two, and 1 three. Note that this depends on being allowed to include as many trailing zeros as suit, without them adding any further information about the other present digits.

Because leading zeros are not written down, every autobiographical number contains at least one zero, so that its first digit is nonzero.

Considering a hypothetical case where the digits are treated in the opposite order: the units is the count of zeros, the 10s the count of ones, and so on, there are no such self-describing numbers. Attempts to construct one result in an explosive requirement to add more and more digits.

• Pickover, Clifford (1995). "Chapter 28, Chaos in Ontario". Keys to Infinity. New York: Wiley. pp. 217–219. ISBN 978-0471118572.
• Weisstein, Eric W. "Self-Descriptive Number". MathWorld.
• Sloane, N. J. A. (ed.). "Sequence A108551 (Self-descriptive numbers in various bases)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
• Sloane, N. J. A. (ed.). "Sequence A046043 (Autobiographical numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
• Khovanova, Tanya (2008), Autobiographical Numbers, arXiv:0803.0270

• Khovanova, Tanya (23 August 2018). "Can You Solve the Leonardo da Vinci Riddle?". Lesson about autobiographical numbers. TED-Ed.