A cyclic number $n$ is an integer which in a given base $b$ maintains the same digits after repeated multiplications. For example, twice 142857 is 285714; thrice is 428571; four times is 571428; etc. Cyclic numbers are tied to the full reptend primes $p$ thus:

From this it follows that the base $b$ representation of the number $np$ consists of $p-1$ instances of the digit $b-1$. For $mn$ with $m>p$ the multiples gradually begin to exhibit greater variety in their digits, with the occasional number nearly full of digits $b-1$.

In base 10, the first few cyclic numbers are 142857, 588235294117647, 52631578947368421, 434782608695652173913, 344827586206896551724137931, 212765957446808510638297872340425531914893617, etc.

There are no cyclic numbers in factorial base or primorial base because not every digit can occupy every significant position. For example, take the multiples of 142857 in factorial base: 34222111, 70444300, 115012011, 151234200, 185501311, 232024100, 266251211. The digit 4 can only occur to the left of $d_{3}$.

Confusingly, Sloane’s OEIS uses this term to refer to the full reptend primes instead of the cyclic numbers they generate.