```python
def first_Factorial_Divisible_Number(x):
    
    def count_prime_factors_in_factorial(n, p):
        count = 0
        power_of_p = p
        while power_of_p <= n:
            count += n // power_of_p
            if power_of_p > n // p:
                break
            power_of_p *= p
        return count

    def find_smallest_n(p, a):
        low = 1
        high = p * a
        ans = high

        while low <= high:
            mid = low + (high - low) // 2
            if count_prime_factors_in_factorial(mid, p) >= a:
                ans = mid
                high = mid - 1
            else:
                low = mid + 1
        return ans

    if x == 1:
        return 1

    max_n = 0
    temp_x = x

    d = 2
    while d * d <= temp_x:
        if temp_x % d == 0:
            count = 0
            while temp_x % d == 0:
                count += 1
                temp_x //= d
            
            required_n = find_smallest_n(d, count)
            max_n = max(max_n, required_n)
        d += 1
    
    if temp_x > 1:
        required_n = temp_x
        max_n = max(max_n, required_n)
            
    return max_n
```