640000

Appears in sequences

• a(n) = Product_{i=0..8} floor((n+i)/9).at n=40A009714
• Droll numbers: numbers > 1 whose sum of even prime factors equals the sum of odd prime factors.at n=30A019507
• Numbers of form 4^i*10^j, with i, j >= 0.at n=35A025621
• Numbers of form 8^i*10^j, with i, j >= 0.at n=25A025634
• Squares with digits in nonincreasing order.at n=21A028822
• Squares whose digits are all even.at n=22A030098
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*10^j.at n=18A038288
• Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*8^j.at n=17A038310
• a(1) = 8; for n > 1, a(n+1) = a(n) * sum of digits of a(n).at n=5A047900
• Squares resulting from procedure described in A048391.at n=14A048392
• a(n) = n^(n+1)*(n+1)^n.at n=4A051443
• a(n) = n^4 * 4^n.at n=5A062075
• Array A(n, k) = n^k * k^n, n, k >= 0, read by antidiagonals.at n=50A062275
• Array A(n, k) = n^k * k^n, n, k >= 0, read by antidiagonals.at n=49A062275
• Squares in which removing a suitably chosen digit yields another square and this process can be continued until the digits are exhausted.at n=35A062387
• Numbers whose product of distinct prime factors is equal to its sum of digits.at n=24A067077
• Numbers n such that n and its 10's complement are both squares, i.e., n and 10^k - n (where k is the number of digits in n) are squares.at n=18A068810
• Numbers divisible by the 4th power of the sum of their digits in base 10.at n=32A072083
• Even-digit perfect powers.at n=25A075787
• a(1)=1 and for n>1, a(n) is the smallest multiple of a(n-1) which has no nonzero digit in common with a(n-1).at n=14A079838