Any digital permutation
JavaScript (ES7), 13 12 bytes


let f =

_=&gt;266**6+19

console.log(f())



This computes: 2666 + 19 = 354233654641216 + 19 = 354233654641235
There are two triples (a, b, c) with 0 &lt; a &lt; 1000, 0 &lt; b &lt; 10, 0 &lt; c &lt; 100 and ab + c satisfying the condition.
The following snippet finds them almost instantly.


for(a = 1; a &lt; 1000; a++) {
  for(b = 1; b &lt; 10; b++) {
    for(c = 1; c &lt; 100; c++) {
      if((r = a**b + c + '').match(/^[1-6]+$/) &amp;&amp; [...r].sort().join`` == '122333344455566') {
        console.log(a + '**' + b + ' + ' + c + ' = ' + r);
      }
    }
  }
}