number. Find every way to write it as a product of **two or more** integer factors, each at least 2 and less than number itself.
Write each way as a list of factors in non-decreasing order, [2, 2, 3] rather than [3, 2, 2], so that no product is listed twice. Return all of them in any order. If there are none, return an empty list.number=18 → [[2, 9], [2, 3, 3], [3, 6]]
18 = 2 · 9 = 3 · 6 = 2 · 3 · 3. The lists may come in any order, but each one is non-decreasing.
number=16 → [[2, 8], [2, 2, 4], [2, 2, 2, 2], [4, 4]]
16 = 2 · 8 = 4 · 4 = 2 · 2 · 4 = 2 · 2 · 2 · 2.
number=13 → []
13 is prime, so it has no split into factors greater than 1 and less than 13.
number ≤ 10⁷number=18
[[2, 9], [2, 3, 3], [3, 6]]
Run checks the first 3 tests in your browser. Submit checks all 60 tests on the server, hidden ones included.