Palindromic Prime Factors Palindromic prime problems are pretty common, but that's not what this question is about. In this challenge, the number doesn't have to be a palindrome, its prime factors do.
Task
Your code has to take a single positive integer as input. Then check if any of the permutations of the prime factors of that integer are palindromic when concatenated. If so, output one of them (the list of factors, not the concatenated string). Else, you have to output -1.
This is code-golf, so shortest code in bytes wins!
Test Cases
11 -&gt; [11]
4 -&gt; [2, 2]
39 -&gt; [3, 13]
6 -&gt; -1
1207 -&gt; [17, 71]
393 -&gt; -1
2352 -&gt; [2, 2, 7, 3, 7, 2, 2]
05AB1E, 7 bytes

Òœ.ΔJÂQ


Try it online!

Explanation:

Ò            # prime factorization of the input
 œ           # permutations
  .Δ         # find the first one such that
    J        # concatenated
     ÂQ      # is a palindrome


(.Δ conveniently defaults to -1, so no extra work needed)