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

    A Keith number is an integer N with d digits, where a Fibonacci-like
    sequence starting with the d digits of N eventually contains N itself.
    """
    # By definition, Keith numbers are positive integers with at least 2 digits.
    # This check handles non-positive numbers and single-digit numbers.
    if x < 10:
        return False

    # Get the initial terms of the sequence from the digits of the number.
    # For example, for the number 197, the sequence starts with [1, 9, 7].
    number_str = str(x)
    num_digits = len(number_str)
    sequence = [int(digit) for digit in number_str]

    # Generate new terms for the sequence until the last term is greater than
    # or equal to the original number.
    while sequence[-1] < x:
        # The next term is the sum of the last 'num_digits' terms.
        # For 197 (3 digits), the next term is the sum of the last 3 elements.
        next_term = sum(sequence[-num_digits:])
        sequence.append(next_term)

    # The number is a Keith number if the last generated term is exactly
    # equal to the number itself.
    return sequence[-1] == x

```