Split a number in every possible way You task here is very simple:
Given a positive integer n without leading zeroes as input, split it in all possible ways
Examples
Input-&gt;Output
111  -&gt; {{111}, {1, 11}, {11, 1}, {1, 1, 1}}

123  -&gt; {{123}, {12, 3}, {1, 23}, {1, 2, 3}}  
  
8451 -&gt; {{8451}, {845, 1}, {8, 451}, {84, 51}, {84, 5, 1}, {8, 45, 1}, {8, 4, 51}, {8, 4, 5, 1}}  

10002-&gt; {{10002},{1,2},{10,2},{100,2},{1000,2},{1,0,2},{10,0,2},{100,0,2},{1,0,0,2},{10,0,0,2},{1,0,0,0,2}}

42690-&gt; {{42690}, {4269, 0}, {4, 2690}, {426, 90}, {42, 690}, {426, 9, 0}, {4, 269, 0}, {4, 2, 690}, {42, 69, 0},  {42, 6, 90}, {4, 26, 90}, {42, 6, 9, 0}, {4, 26, 9, 0}, {4, 2, 69, 0}, {4, 2, 6, 90}, {4, 2, 6, 9,  0}}      

       
Rules
Leading zeroes, if they occur, should be removed.
Duplicate partitions in your final list should also be removed.
The order in which the partitions appear in the final list is irrelevant.
This is code-golf. Shortest answer in bytes, wins!
Sandbox
Brachylog, 8 bytes
ṫ{~cịᵐ}ᵘ

Convert to string ṫ and get all unique {…}ᵘ reverse concatenations ~c mapped to integers ịᵐ (to remove leading zeros).
Try it online!