or
liek
number counting
Given a number sequence, split the number sequence into consecutive digits, and then output how many of these 2-digit sequences are primes.
## Explanation
For example, 7112971 gets splitted into:

[71,11,12,29,97,71]

You are required to find our how many of these numbers are primes.

## Test cases
|Input|Output|
|:---:|:----:|
|619737131179|11|
|7112971|5|
|7834741|3|
|127456398|0|
# [APL (Dyalog Extended)], 12 [bytes](https://codegolf.meta.stackexchange.com/a/9429/43319 "When can APL characters be counted as 1 byte each?") ([SBCS](https://github.com/abrudz/SBCS ".dyalog files using a single byte character set"))

Anonymous tacit prefix function

apl
+/1⍭10⊥¨2,/⊢


[Try it online!][TIO-k88nntu1]

⊢ the argument

2,/ pair-wise concatenation

10⊥¨ evaluate each as base-10

1⍭ indicate the primes

+/ sum

[APL (Dyalog Extended)]: https://github.com/abrudz/dyalog-apl-extended
[TIO-k88nntu1]: https://tio.run/##SyzI0U2pTMzJT9dNrShJzUtJTfn/X1vf8FHvWkODR11LD60w0tF/1LXof9qjtgmPevsedTU/6l3zqHfLofXGj9omPuqbGhzkDCRDPDyD/6cpmCkYKlgqmCsYA7EhkDQEQnMFS640MN9QwQgsawjmWwDlTYC0CZgPkgOxTYFmGANVWQAA "APL (Dyalog Extended) – Try It Online"
Count Consecutive Primes
Mathgeek
"Find which consecutive elements in a number are prime" is a sufficient enough one-phase explanation, but I believe the OP tried to explain it this way to make it easier to understand. I don't necessarily agree with the idea that the challenge itself violates 16.
@liek The splitting and the prime number checking are not really related. Combining them goes against [our best practices](https://topanswers.xyz/codegolf?q=736) (see number 16 there).
Every consecutive 2-digit combination. 713 becomes 71 and 13.
@liek I don't understand how the splitting works? Always into groups of 2? But 7112971 has an odd number of digits!