Properties of the Number 36409

Thirty-Six Thousand Four Hundred Nine

Basics

Value: 36408 → 36409 → 36410

Parity: odd

Prime: No

Previous Prime: 36389

Next Prime: 36433

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 23 × 1583

Divisors: 1, 23, 1583, 36409

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000111000111001

Octal: 107071

Duodecimal: 190A1

Hexadecimal: 8e39

Square: 1325615281

Square Root: 190.8114252344445

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) = ((3·n+1)*2ⁿ - (-1)ⁿ)/9. A45883

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = A023531, t = (Fibonacci numbers). A24318

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = A023531, t = (F(2), F(3), ...). A24322

a(1)=1, a(n) = n·4^n-1 + a(n-1). A14916

Fibonacci sequence beginning 5, 11. A22136

Expansion of e.g.f. cosh(sinh(x)*exp(x)). A9153

Square array T(n,k) read by antidiagonals where T(0,k) = 0 and T(n,k) = 1 + 2k + 3k² + ... + n·k^n-1. A59045

Number of multiples of n which have only distinct and nonzero digits in base 10. A328287

Triangle read by rows, generated from (..., 3, 2, 1). A108283

a(n) = 1681·n² - 984·n - 696. A118060