------
## 最终结论
```python
def is_woodall(num):
    n = 1
    while True:
        woodall_number = n * (2 ** n) - 1
        if woodall_number == num:
            return True
        elif woodall_number > num:
            return False
        n += 1

# Test cases
assert is_woodall(383) == True
assert is_woodall(254) == False
assert is_woodall(200) == False
```