Calculating all prime palindromes from 0 to 1000 and printing the largest
The list comprehension [x for x in range(0,1001)] is redundant, as range already returns a list in Python 2. In Python 3 one can use list(range(1001))
Write a docstring instead of a comment to describe a function.
Why is count a float (2.0) in prime_check? Should be an int.
Prefer for loops to while loops when they do the same thing. Eg. use for count in xrange(2, k) in prime_check.
if any_num &lt; 20 and any_num &gt;= 1: can be written as if 1 &lt;= any_num &lt; 20:
You may want to look for more efficient algorithms for generating primes.