def first_Factorial_Divisible_Number(x):
    if x <= 1:
        return 1

    n = 0
    d = 2
    temp = x

    while d * d <= temp:
        if temp % d == 0:
            required = 0
            while temp % d == 0:
                temp //= d
                required += 1

            low, high = 1, d * required
            while low < high:
                mid = (low + high) // 2
                count = 0
                p = d
                while p <= mid:
                    count += mid // p
                    if p > mid // d:
                        break
                    p *= d
                if count >= required:
                    high = mid
                else:
                    low = mid + 1

            if low > n:
                n = low
        d += 1 if d == 2 else 2

    if temp > 1 and temp > n:
        n = temp

    return n