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