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