nthprime.js

const getNthPrime = (position) => { 
  const primeNumbers = [2];
  for(let i = 3; primeNumbers.length < position; i += 2) {
    let numberIsPrime = true;
    for(let j = 0; j < primeNumbers.length && Math.pow(primeNumbers[j], 2) <= i; j++) {
      if(i % primeNumbers[j] === 0){
        numberIsPrime = false;
        break;
      }
    }
    if(numberIsPrime){
      primeNumbers.push(i);
    }
  }
  return primeNumbers[position - 1];
}

console.log(getNthPrime(10001));