Step 1: Divide the number into separate digits:
19893 => 1 9 8 9 3
Step 2: Calculate the distance between each digit and the next (the last digit with the first):
1 to 9 => 8
9 to 8 => 1
8 to 9 => 1
9 to 3 => 6
3 to 1 => 2
Step 3: Convert distances to codes (0=E[qual],
1 & 9 = C[onsecutive], 2-8 = N[one]):
8 => N
1 => C
1 => C
6 => N
2 => N
Step 4: Combine the filters to a string:
N C C N N = NCCNN