361131

Appears in sequences

• Min{m: n = Sum((m mod (1+k*L(n)!))*2^(k-1): 1<=k<=L(n))}, where L(n) = length of binary representation of n, cf. A070939, A000142.at n=7A094096
• a(n) = number of 8-digit primes with digit sum n, where n runs through the non-multiples of 3 in the range [2..71].at n=22A178879