Any digital permutation Task
Your task is to output a single integer, with one restriction: its digits must be a permutation of [1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6].
For example, you could output 653443653152432, 413265345463352, or any of the other 15-digit integers whose digits are a permutation of the list.
Rules

Your code must terminate in a reasonable amount of time (do not just enumerate every integer until you get to 122333344455566).

If your language doesn't support 15-digit integers, or if there is no meaningful distinction between strings and integers in your language, you may output a string.

This is code-golf, shortest answer in bytes wins.
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);
      }
    }
  }
}