input: Write a python function to sum all prime numbers in a given list of integers.
  assert sum_primes([2, 3, 9, 14]) == 5
  assert sum_primes([1, 4, 6, 8, 10]) == 0
  assert sum_primes([17, 19, 23, 29, 31]) == 119
  assert sum_primes([2, 3, 5, 7, 11, 13]) == 41
output: def sum_primes(numbers):
      def is_prime(n):
          if n <= 1:
              return False
          for i in range(2, int(n ** 0.5) + 1):
              if n % i == 0:
                  return False
          return True
      
      return sum(filter(is_prime, numbers))