The numerical value of Khinchin's constant 
is given by
 |
(OEIS A002210). However, the numerical value of 
is notoriously difficult to calculate to high precision. Bailey et al. (1997)
computed 
to 7350 digits, and the current record is 
digits, computed by Xavier Gourdon in 1997 with a computation
requiring 22 hours and 23 minutes (Plouffe).
The Earls sequence (starting position of 
copies of the digit 
) for Khinchin's constant is given for 
, 2, ... by 9, 42, 1799, 494, 5760, ... (OEIS A224836),
with the 
term being larger than 
.
-constant primes occur at 1, 407, 878, 4443, 4981,
6551, 13386, 28433, ... decimal digits (OEIS A118327).
The starting positions of the first occurrence of 
, 1, 2, ... in the decimal expansion of 
(including the initial 2 and counting it as the first digit)
are 8, 10, 1, 14, 5, 4, 2, 23, 3, 22, ... (OEIS A229196).
Scanning the decimal expansion of 
until all 
-digit numbers have occurred, the last 1-, 2-, ... digit numbers
appearing are 7, 43, 782, ... (OEIS A000000),
which end at digits 23, 499, 8254, ... (OEIS A000000).
It is not known if 
is normal, but the following
table giving the counts of digits in the first 
terms shows that the decimal digits are very uniformly
distributed up to at least 
.
