```python
def is_woodall(x):
    """
    Checks if a given number x is a Woodall number.
    A Woodall number is a number of the form W_n = n * 2^n - 1 for n >= 1.
    """
    # Woodall numbers (for n >= 1) are always positive and odd.
    # W_1 = 1 * 2^1 - 1 = 1
    # W_2 = 2 * 2^2 - 1 = 7
    # W_3 = 3 * 2^3 - 1 = 23
    if x <= 0 or x % 2 == 0:
        return False

    # The condition x = n * 2^n - 1 is equivalent to x + 1 = n * 2^n.
    # We can iterate through n and check if this condition holds.
    y = x + 1
    n = 0
    term = 0
    
    # The loop calculates term = n * 2^n until it is >= y.
    while term < y:
        n += 1
        # Using bit shift (1 << n) for 2^n is efficient.
        term = n * (1 << n)

    # If the calculated term for some n equals y, then x is a Woodall number.
    return term == y

```