Find digits in base 10:

Find digits in base 2:

Find digits in base 16:

Arbitrarily large bases can be used:

Find digits in a mixed radix system:

The place values are incremental products of the bases in the list:

Reconstruct the original value:

There will never be more than Length[bases]+1 digits; the highest-value digit can grow arbitrarily large:

IntegerDigits threads itself over elements of lists:

Find the digits of 7 in different bases:

By default, IntegerDigits includes no leading zeros:

Pad all digit lists to be length 3:

Find only the last 4 digits:

Find digits using a MixedRadix specification:

Find only the last 2 digits:

Leading digits of factorials:

ChampernowneNumber has a decimal expansion that is a concatenation of consecutive integers:

Compare to ChampernowneNumber:

Cantor set construction:

Construct a van der Corput sequence:

The sequence forms a dense set that is equidistributed in the unit interval:

Build a Halton sequence:

Illustrate low-discrepancy property of the sequence:

IntegerDigits[0] gives {0}:

Find all combinations of 3 binary digits:

Pad digit lists to be the same length:

The sign is ignored:

Express an amount of seconds in hours, minutes, and seconds:

It can also be obtained with NumberDecompose:

Perform the same computation using Quantity objects:

DigitCount and IntegerDigits consider 0 to consist of a single digit:

IntegerLength, by contrast, considers 0 to have no digits:

Leading digits of factorials in base 100: