def rearrange_bigger(n):
    digits = list(str(n))
    length = len(digits)
    
    # Find the rightmost digit that is smaller than the digit to its right
    i = length - 2
    while i >= 0 and digits[i] >= digits[i + 1]:
        i -= 1
    
    if i < 0:
        return False
    
    # Find the smallest digit to the right of i that is greater than digits[i]
    j = length - 1
    while digits[j] <= digits[i]:
        j -= 1
    
    # Swap
    digits[i], digits[j] = digits[j], digits[i]
    
    # Reverse the suffix after position i
    digits[i + 1:] = digits[i + 1:][::-1]
    
    return int(''.join(digits))