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