2^53 prints 9.007199254741⋅10+15. Ask for 2^53 + 1 and the screen prints exactly the same string — not a rounding of the difference, but the same value, because no representable number sits between them. Then subtract: 2^53 + 1 − 2^53 comes back 0, an arithmetic statement that two numbers which are certainly not equal are equal. One power lower, 2^52 + 1 − 2^52 still prints 1, so the failure is at the top of the range, not the bottom.
The reason is the same 53 bits behind machine epsilon, which is the relative spacing between numbers near 1: 2.2204460492503⋅10−16, or 2⁻⁵². Spacing grows with magnitude, so by the time the value reaches 2^53 the gap between neighbours has widened to exactly 2 — and the odd integers above 2^53 do not exist in binary64 at all. Both screens are showing one fact from either end: the relative error near 1, and the absolute error near the largest countable integer.
Answer
9.007199254741⋅10+15
How to read it
2^53 on the workbench. The proof that it is the limit is the subtraction: 2^53+1 − 2^53 prints 0, while one power lower it prints 1.
Source
IEEE-754 binary64 has a 53-bit significand, so 2^53 is the first integer whose neighbours are two apart; exposed as Number.MAX_SAFE_INTEGER + 1 in JavaScript
Work it in the calculator
These links open the right calculator with this problem's numbers already typed in. The line above is what the screen should show — check it yourself.