purePrimeOdd.js

function onlyOddDigPrimes(n) {

    let purePrimes = [];
    let purePrimeCounter = 0;
    
    if (n < 2) return [];

    for (let i = 2; i <= n; i++) {
      if (isPurePrime(i)) {
        purePrimeCounter++;
        purePrimes.push(i);
        if (i === n) {
          return [purePrimeCounter, i, i]
        }
      }
    }
    
    
    while (!isPurePrime(n)) n++;
    return [purePrimeCounter, purePrimes.slice(-1)[0], n];
      
}

function isPurePrime(num) {
  if (num.toString().split('').some(item => Number(item) % 2 === 0 )) return false
  
  for ( let i = 2; i < num; i++ ) {
    if (num % i === 0) return false;
  }
  
  return true;
}