import math


def prime_check(number: int) -> bool:
    """Checks to see if a number is a prime in O(sqrt(n)).

    A number is prime if it has exactly two factors: 1 and itself.

    >>> prime_check(0)
    False
    >>> prime_check(1)
    False
    >>> prime_check(2)
    True
    >>> prime_check(3)
    True
    >>> prime_check(27)
    False
    >>> prime_check(87)
    False
    >>> prime_check(563)
    True
    >>> prime_check(2999)
    True
    >>> prime_check(67483)
    False
    """

    if 1 < number < 4:
        # 2 and 3 are primes
        return True
    elif number < 2 or not number % 2:
        # Negatives, 0, 1 and all even numbers are not primes
        return False

    odd_numbers = range(3, int(math.sqrt(number) + 1), 2)
    return not any(not number % i for i in odd_numbers)