> For the complete documentation index, see [llms.txt](https://jaywin.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://jaywin.gitbook.io/leetcode/solutions/0625-minimum-factorization.md).

# 0625. Minimum Factorization

<https://leetcode.com/problems/minimum-factorization>

## Description

Given a positive integer num, return *the smallest positive integer* `x` *whose multiplication of each digit equals* `num`. If there is no answer or the answer is not fit in **32-bit** signed integer, return `0`.

**Example 1:**

```
**Input:** num = 48
**Output:** 68
```

**Example 2:**

```
**Input:** num = 15
**Output:** 35
```

**Constraints:**

* `1 <= num <= 231 - 1`

## ac

```java
```