------
## 最终结论
```python
def rearrange_bigger(n):
    digits = list(str(n))
    length = len(digits)

    # Step 1: Find the rightmost ascent
    i = length - 2
    while i >= 0 and digits[i] >= digits[i + 1]:
        i -= 1

    # If no ascent is found, return False
    if i == -1:
        return False

    # Step 2: Find the smallest digit on right side of the ascent which is larger than digits[i]
    j = length - 1
    while digits[j] <= digits[i]:
        j -= 1

    # Step 3: Swap the found digits
    digits[i], digits[j] = digits[j], digits[i]

    # Step 4: Reverse the sequence after the position i
    digits = digits[:i + 1] + sorted(digits[i + 1:])

    return int(''.join(digits))

# Test cases
assert rearrange_bigger(12) == 21
assert rearrange_bigger(10) == False
assert rearrange_bigger(102) == 120
```