Hostile Divisor Numbers Some divisors of positive integers really hate each other and they don't like to share one or more common digits.  

Those integers are called Hostile Divisor Numbers (HDN)    

Examples    

Number 9566 has 4 divisors: 1, 2, 4783 and 9566
(as you can see, no two of them share the same digit).
Thus, 9566 is a Hostile Divisor Number     

Number 9567 is NOT HDN because its divisors (1, 3, 9, 1063, 3189, 9567) share some common digits.   

Here are the first few HDN     

1,2,3,4,5,6,7,8,9,23,27,29,37,43,47,49,53,59,67,73,79,83,86,87,89,97,223,227,229,233,239,257,263,267,269,277,283,293,307,337...       




Task    

The above list goes on and your task is to find the nth HDN    

Input   

A positive integer n from 1 to 4000    

Output     

The nth HDN    

Test Cases    

here are some 1-indexed test cases.
Please state which indexing system you use in your answer to avoid confusion.     

input -&gt; output     
 1        1     
 10       23       
 101      853     
 1012     26053     
 3098     66686      
 4000     85009      


This is code-golf, so the lowest score in bytes wins.      

EDIT     

Good news!
I submitted my sequence to OEIS and...
Hostile Divisor Numbers are now OEIS A307636
05AB1E, 12 10 bytes
µNNÑ€ÙSDÙQ

-2 bytes thanks to @Emigna.
1-indexed
Try it online or verify most test cases (last two test cases are omitted, since they time out).
Explanation:

µ           # Loop while the counter_variable is not equal to the (implicit) input yet:
 N          #  Push the 0-based index of the loop to the stack
  NÑ        #  Get the divisors of the 0-based index as well
            #   i.e. N=9566 → [1,2,4783,9566]
            #   i.e. N=9567 → [1,3,9,1063,3189,9567]
    €Ù      #  Uniquify the digits of each divisor
            #   → [&quot;1&quot;,&quot;2&quot;,&quot;4783&quot;,&quot;956&quot;]
            #   → [&quot;1&quot;,&quot;3&quot;,&quot;9&quot;,&quot;1063&quot;,&quot;3189&quot;,&quot;9567&quot;]
      S     #  Convert it to a flattened list of digits
            #   → [&quot;1&quot;,&quot;2&quot;,&quot;4&quot;,&quot;7&quot;,&quot;8&quot;,&quot;3&quot;,&quot;9&quot;,&quot;5&quot;,&quot;6&quot;]
            #   → [&quot;1&quot;,&quot;3&quot;,&quot;9&quot;,&quot;1&quot;,&quot;0&quot;,&quot;6&quot;,&quot;3&quot;,&quot;3&quot;,&quot;1&quot;,&quot;8&quot;,&quot;9&quot;,&quot;9&quot;,&quot;5&quot;,&quot;6&quot;,&quot;7&quot;]
       D    #  Duplicate this list
        Ù   #  Unique the digits
            #   → [&quot;1&quot;,&quot;2&quot;,&quot;4&quot;,&quot;7&quot;,&quot;8&quot;,&quot;3&quot;,&quot;9&quot;,&quot;5&quot;,&quot;6&quot;]
            #   → [&quot;1&quot;,&quot;3&quot;,&quot;9&quot;,&quot;0&quot;,&quot;6&quot;,&quot;8&quot;,&quot;5&quot;,&quot;7&quot;]
         Q  #  And check if it is still equal to the duplicated list
            #   → 1 (truthy)
            #   → 0 (falsey)
            #  And if it's truthy: implicitly increase the counter_variable by 1
            # (After the loop: implicitly output the top of the stack,
            #  which is the pushed index)