Properties of the Number 40336

Forty Thousand Three Hundred Thirty-Six

Basics

Value: 40335 → 40336 → 40337

Parity: even

Prime: No

Previous Prime: 40289

Next Prime: 40343

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ⁴ × 2521

Divisors: 1, 2, 4, 8, 16, 2521, 5042, 10084, 20168, 40336

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001110110010000

Octal: 116620

Duodecimal: 1B414

Hexadecimal: 9d90

Square: 1626992896

Square Root: 200.83824337013107

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

a(n) = 8·7*6·5*4·3*2·1 + 16·15·14·12·11·10·9 + ... + (up to the n-th term). A319872

Number of nX1 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and no element equal to any horizontal or vertical neighbor. A199126

Number of n X 5 0..1 arrays with every element unequal to 0, 1, 2 or 7 king-move adjacent elements, with upper left element zero. A304227

a(n) = floor(τ*a(n-1)) + a(n-2) with a(0)=0 and a(1)=2. A5829

Let N(k) and D(k) be the sequences defined in A054765 and A012244; write N(k)* D(k+j ) - N(k+j)*D(k) = (-1)^k+1*(k!)²*P(k) where P(k) is a polynomial in k of degree j-1; sequence gives coefficients of expansion of P(k) in powers of k for j=1,2,3,... A54798

Triangle sequence:t(n,m)=(2 n - Binomial[n, m] + m! + (-m + n)!). A155169

A symmetrical triangle sequence:t(n,m)=(-1)^m*(n - m)!*Binomial[n - 1, m] + (-1)^{n - m + 1}*(n - (n - m + 1))!*Binomial[n - 1, n - m + 1]. A176862

E.g.f. satisfies: A(x) = sinh(x + Integral A(x) dx). A235038

Words of length n over the alphabet {0,...,n-1} that avoid the pattern 1231. A239377

A q-factorial type triangle sequence: t(n,m)=Product[Sum[(m + 1)ⁱ, {i, 0, k - 1}], {k, 1, n}]. A156173