699999

Appears in sequences

• a(n) is the smallest composite number with the sum of digits = the n-th composite number.at n=34A073866
• Largest n-digit squarefree number beginning with n.at n=5A077514
• Triangle read by rows: T(n, k) = 10^(n-1) - 1 + k*floor(9*10^(n-1)/n), for 1 <= k <= n.at n=18A093846
• Smallest number whose sum of digits is 2n+1.at n=25A131668
• Smallest number whose sum of digits is 3n.at n=17A133195
• The smallest composite number larger than the n-th composite number, which has a sum of digits equal to the n-th composite number.at n=34A161551
• Lexicographically earliest injective sequence such that a(n) = A007953(a(a(n))), where A007953 = sum of digits (in base 10).at n=50A167152
• a(n) = 7*10^n - 1.at n=5A198699
• A number N is called a "rebel" number if there do not exist two integers a and b such that N = a + b with a > b > 0 and S(a) = S(b) where S(n) is the sum of the digits of the number n.at n=43A292514
• a(n) is the least k such that the sum of digits of k is a substring of n and the sum of digits of n is a substring of k.at n=51A344486