uncomputable : a number is computable ⇔ exists turing machine which outputs it, but there are only countably many Turing machines
normal (the digits of their n-ary expansion are uniformly distributed) : Borel's Theorem
members of a (particular) meagre set : see Fat Cantor Sets (thanks to Jake Fiedler!)
transcedental : Each non-transcedental number is the root of a polynomial, there are countably many polynomials, and each polynomial has finitely many roots
S-numbers of type 1 : proven by Sprindzhuk, at least according to this book, p. 86 (I couldn't find the actual proof). Also see this Wikipedia page.
an equivalence class of "almost homomorphisms" f:Z→Z where {f(m+n)−f(n)−f(m):n,m∈Z} is finite, and f∼g whenever {f(n)−g(n):n∈Z} is finite : see Eudoxus real number, or this more explicit paper (contribution from Nick Mahdavi)
Martin-Löf random : given a particular constructive null cover U1⊇U2⊇… we have μ(⋂n=1∞Un)=0, and there are only countably many of these (as each Ui is an effective open set and hence determined by a Turing machine), so the set of Martin-Löf random numbers has full measure; see Algorithmically random sequence (contribution from Jake Fiedler)
As it turns out, the set of all Martin-Löf random real numbers is also meagre!
Most real numbers have...
a corresponding subset of N with positive upper density : most real numbers are normal, so by definition the upper density of their corresponding set is 21
a continued fraction expansion a1+a2+a3+…11 with limn→∞(a1a2…an)n1=K0≈2.68545 : see Khinchin's Constant (contribution from Nick Mahdavi)
a continued fraction expansion a1+a2+a3+…11 with limn→∞ann1=eπ2/(12ln2)≈3.27582 : see Lévy's constant