function isPrime(number) {
if (number <= 1) {
return false;
}
for (let i = 2; i <= Math.sqrt(number); i++) {
if (number % i === 0) {
return false;
}
}
return true;
}
function solution(n, k) {
let answer = 0;
const converted = n.toString(k);// k진법으로 변환
const arr = converted.split('0').filter(f=> f !== '');//0으로 split
for(let i=0; i< arr.length; i++){
if(isPrime(arr[i])) answer++;//소수체크
}
return answer;
}