Properties of the Number 40397

Forty Thousand Three Hundred Ninety-Seven

Basics

Value: 40396 → 40397 → 40398

Parity: odd

Prime: No

Previous Prime: 40387

Next Prime: 40423

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 7 × 29 × 199

Divisors: 1, 7, 29, 199, 203, 1393, 5771, 40397

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001110111001101

Octal: 116715

Duodecimal: 1B465

Hexadecimal: 9dcd

Square: 1631917609

Square Root: 200.9900495049444

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

Sum of 11 positive 9th powers. A4800

Expansion of 1 - x/(1 - x²/(1 - x³/(1 - x⁴/(1 - x⁵/(1 - x⁶/(1 - ... - xⁿ/(1 - ...))))))), a continued fraction. A291148

[ (3rd elementary symmetric function of 3,4,...,n+4)/(3+4+...+n+4) ]. A24191

Composite squarefree numbers n such that p(i)+5 divides n-5, where p(i) are the prime factors of n. A225715

a(n) = (6·n+1)*(6·n+5). A1513

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 237", based on the 5-celled von Neumann neighborhood. A270982

Triangular array read by rows: T(n,k) is the number of simple labeled graphs on n nodes with exactly k components where each component has at most one cycle; n>=1, 1<=k<=n. A217756

G.f. A(x) satisfies: [xⁿ] A(x)ⁿ⁺¹ = [xⁿ] (1 + x·A(x)ⁿ⁺¹)ⁿ⁺¹ for n>=0. A302703

Number of inequivalent (mod D₄) ways five checkers can be placed on an n X n board. A242358

Coefficient of xⁿ in the expansion of ( (1-x) / (1-x-x²) )ⁿ. A370616