def babylonian_squareroot(number):
    if number < 0:
        return None
    if number == 0:
        return 0
    
    guess = number / 2.0
    
    for _ in range(1000):
        better_guess = (guess + number / guess) / 2.0
        if abs(better_guess - guess) < 1e-10:
            break
        guess = better_guess
    
    return better_guess