Prime Numbers Finder Minimal

def number_range_function():
    num_range = []
    print("Input lower limit:")
    lower = int(input())
    print("Input upper limit:")
    upper = int(input())
    while upper > lower:
        num_range.append(lower)
        lower += 1
    num_range.append(lower)
    return num_range
def prime_finder(num_range):
    num_check = 2
    prime = []
    for i in num_range:
        while num_check <= i:
            if i % num_check != 0:
                num_check += 1
            elif num_check == i:
                prime.append(i)
                num_check = 2
                break
            else:
                break
    print("Prime Numbers Are (Total of {} out of {} numbers.):".format(len(prime),len(num_range)))
    print("{}".format(prime))
number_range = number_range_function()
prime_finder(number_range)
exit()