text: // find the prime digit in a number
  function prime_factor(num){
  /**
   * result receive 'i':
   * if dont have the same
   * if number be prime and your divide by 'i' equal 0, 
   * 'i' in that case  is a count of 2 to number
   */
      let result = [];
      // check prime
      if(num % 2 === 0){
          // count 2 to number
          for(i = 2; i <= num;i++){
              // if number divider by 'i' == 0
              while( num % i ==0){
                  // if result have a 'i'
                  if(!result.includes(i)){
                      result.push(i)
                  }
                  num /= i;
              }
          }
      }
      return result;
  }
  console.log(prime_factor(100));