easy solution
Intuitionuse a loop and play around with the upper bound - n cubed in this caseApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->
use a loop and play around with the upper bound - n cubed in this case

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
class Solution:
    def smallestNumber(self, n: int) -> int:

        for i in range(n, n * n * n):
            cur = bin(i)[2:]
            if len(set(cur)) == 1 and cur[0] == "1":
                return i
        return n

```
['Python3']