Finding prime by recursion

JavaScript
#1

Tell us what’s happening:
my code and algorithm working fine and finding largest prime, but I am not able to return the largest prime factor of a given number.
please help me in understanding recursion and returning largest prime factor
Thanks

Your code so far


function largestPrimeFactor(number) {
let  p=2;
let quot=1;
let arr = [];
 if (number ===1)
 return number;
 else{
   while (number%p != 0){
     p++;
   }
 arr.push(p);
 quot = number/p ;  
 // console.log(arr)  ;
return largestPrimeFactor(quot);
 }
}

console.log(largestPrimeFactor(13195))

Your browser information:

User Agent is: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/87.0.4280.88 Safari/537.36.

Challenge: Problem 3: Largest prime factor

Link to the challenge:

#2