1st number = n
2nd number = n+1
3rd number = n+2
sum of the squares of 3 consecutive numbers is 116
n² + (n+1)² + (n+2)² = 116
n² + (n+1)(n+1) + (n+2)(n+2) = 116
n² + [n(n+1)+1(n+1)] + [n(n+2)+2(n+2)] = 116
n² + n² + n + n + 1 + n² + 2n + 2n + 4 = 116
n² + n² + n² + n + n + 2n + 2n + 1 + 4 = 116
3n² + 6n + 5 = 116 Last option.
I like the 'question mark' at the end:
26 letters (English), 10 digits (0,1,...9)
26*26*10*10*10 = 676000
Now, this was for LLDDD (Letter Letter Digit Digit Digit)
It seems this is the order they want. Other wise, one should multiply by all the combinations in the order: LDLDD, DLLDD, etc ... (10 combinations), but again it seems they want this LLDDD
So 676000
Answer:
<em>Value</em><em> </em><em>of</em><em> </em><em>p</em><em> </em><em>is</em><em> </em><em>14</em>
Step-by-step explanation:

<em>HAVE A NICE DAY</em><em>!</em>
<em>THANKS FOR GIVING ME THE OPPORTUNITY</em><em> </em><em>TO ANSWER YOUR QUESTION</em><em>. </em>