```python
def is_num_keith(x):
    """
    Checks if a given number is a Keith number.

    A Keith number is an integer that appears in a Fibonacci-like sequence
    started with its own digits. For a d-digit number, the sequence starts
    with its d digits, and each subsequent term is the sum of the previous d terms.
    If the original number appears in this sequence, it is a Keith number.
    """
    if not isinstance(x, int) or x < 10:
        return False

    s_x = str(x)
    d = len(s_x)
    
    sequence = [int(digit) for digit in s_x]
    
    # The sequence is strictly increasing for x >= 10, so we can stop
    # once a term is greater than or equal to x.
    while sequence[-1] < x:
        next_term = sum(sequence[-d:])
        sequence.append(next_term)
        
    # The number is a Keith number if it is the last term generated in the sequence.
    # We also need to check if x is one of its own digits, but this is impossible for x >= 10.
    return sequence[-1] == x

```