Python: Count all subnumbers of a number which are divisible by a given “prime” number

Question

Assume we are given a number and a prime number, say number and p, repectively. I want to count all subnumbers of number