Math Theorem 2

function isPrime(number) {
 for (var i = 2; i < number - 1; i++) {
  if (number % i === 0 && i !== number && i !== 1) return false;
 }
 return true;
}
function sumOfDigits(number) {
 var strnum = String(number)
 var result = 0
 for (var i = 0; i < strnum.length; i++) {
  result += parseInt(strnum.charAt(i))
 }
 return result;
}
for (var i = 0; i < 999999; i++) {
 if (sumOfDigits(i) === 4 && i % 2 !== 0 && isPrime(i) === true && i % 11 !== 0) {
  console.log(String(i) + " (Is prime as well)")
 }
 else {
  if (sumOfDigits(i) === 4 && i % 2 !== 0 && i % 11 !== 0) {
   console.log(i + " (If you see this, something is wrong)")
  }
 }
}