Prime Numbers Finder

#This code will get a range of numbers and will find all the prime numbers in range
def number_range_function():
#this function takes in a range of numbers and converts it to a list of numbers.
    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)

    print("The number range is:")
    print(num_range)
    print("-----------------------------------------------------------------------------------------------------------")
    return num_range

def prime_finder(num_range):
#this function takes a list of numbers and converts them into 2 lists: 1st list contains all prime numbers in list of
#numbers and the 2nd list contains all the non-prime numbers in that list.
    num_check = 2
    prime=[]
    not_prime=[]
    print("CALCULATING...")
    for i in num_range:
        while num_check <= i:
            if i % num_check != 0:
                num_check+=1
            elif num_check==i:
                print("{} Is INDEED a prime number!".format(i))
                prime.append(i)
                num_check=2
                break
            else:
                print("{} Is NOT a prime number!".format(i))
                not_prime.append(i)
                num_check=2
                break
    print("-----------------------------------------------------------------------------------------------------------")
    print("Prime Numbers Are (Total of {}):".format(len(prime)))
    print("{}".format(prime))
    print("Non-Prime Numbers Are (Total of {}):".format((len(not_prime))))
    print("{}".format(not_prime))
    return prime,not_prime

number_range = number_range_function()
prime_finder(number_range)