Find the nth prime number

Soru7v3.py

def nthPrimeSqrt(n):
	number = 3
	primemultiples = []
	primes = []
	primes.append(2)
	prime = True
	
	while (len(primes)<=n):
		prime = True
		if number in primemultiples:
			prime = False
			number +=2
			continue
		root = int(math.ceil(math.sqrt(number)))
		for i in range (3, root):
			if number%i == 0:
				prime = False
				break
		if(prime):
			multiple = number
			while multiple <= n:
				multiple *= 2
				primemultiples.append(multiple)
			primes.append(number)
		number += 2
	return primes[n-1]