# Self Dividing Number

[Self dividing number 題目](https://leetcode.com/problems/self-dividing-numbers/)

{% embed url="<https://leetcode.com/problems/self-dividing-numbers/>" %}

&#x20;A self-dividing number is a number that is divisible by every digit it contains.

&#x20;For example, 128 is a self-dividing number because `128 % 1 == 0`, `128 % 2 == 0`, and `128 % 8 == 0`.

&#x20;Also, a self-dividing number is not allowed to contain the digit zero.

&#x20;Given a lower and upper number bound, output a list of every possible self dividing number, including the bounds if possible.

**Example 1:**<br>

```
Input: 
left = 1, right = 22
Output: [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://cmmobile.gitbook.io/cmmobilebook/cheng-shi-lian-xi-ti/tiao-jian-luo-ji-lian-xi/self-dividing-number.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.