The proper divisors of 496 are 1, 2, 4, 8, 16, 31, 62, 124 and 248, and the workbench adds them to 496: a number equal to its own parts, which is what perfect means. The same 496 comes out of Euclid's construction, 2⁴·(2⁵ − 1) = 16·31, because 31 is prime. Run the recipe one step earlier with p = 3 and the screen answers 28, and one step earlier still with p = 2 gives 6.
Euler closed the question two thousand years later: every even perfect number is of Euclid's form, so hunting for them is hunting for primes of the shape 2ᵖ − 1. That is also why the list jumps. The exponent p = 11 fails because 2¹¹ − 1 = 2047 is 23 × 89, so there is no perfect number between 8128 and 33,550,336 — a gap the ancients, who liked 6 and 28 and 496 as a neat ladder, did not know they were leaving. Every perfect number found since has been even, and no odd one has ever been exhibited.
Answer
496
How to read it
The sum of the proper divisors of 496. The second link is Euclid's recipe for the same number; the third shows the previous perfect number, 28.
Source
Euclid, Elements IX.36 gives the recipe; Euler proved that every even perfect number has that form, reading the paper to the Berlin Academy in 1747; the sequence runs 6, 28, 496, 8128
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.