import math

def is_prime(n):
 # Check if the input is an integer
 if not isinstance(n, int):
 return False
 # Handle numbers less than or equal to 1
 if n <= 1:
 return False
 # Check if the number is 2 (the smallest prime)
 if n == 2:
 return True
 # If even and greater than 2, it's not a prime
 if n % 2 == 0:
 return False
 # Determine the maximum divisor to check up to sqrt(n), inclusive
 max_divisor = int(math.sqrt(n))
 # Check for odd divisors from 3 to max_divisor (inclusive)
 for i in range(3, max_divisor + 1, 2):
 if n % i == 0:
 return False
 # If no divisors found, the number is prime
 return True