Properties of the Number 43806

Forty-Three Thousand Eight Hundred Six

Basics

Value: 43805 → 43806 → 43807

Parity: even

Prime: No

Previous Prime: 43801

Next Prime: 43853

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 7 ² × 149

Divisors: 1, 2, 3, 6, 7, 14, 21, 42, 49, 98

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010101100011110

Octal: 125436

Duodecimal: 21426

Hexadecimal: ab1e

Square: 1918965636

Square Root: 209.29882942816474

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

Triangle read by rows: T(n,k) is the number of configurations with exactly k polyomino matchings in a generalized game of memory played on the path of length 4n. A334057

a(n) = A306896(n)/6. A306897

Apply the "Stirling-Bernoulli transform" to A000081 = (1,1,1,2,4,9,20,...), rooted trees. A51784

Triangle read by rows: T(n,k) = t(n,k) + t(n,n-k), where t(n,k) = 2*(n!/k!)*(2*(n + k) - 1). A154987

Numbers k such that 477·2^k+1 is prime. A319487

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (-1, 0, 1), (1, -1, 0), (1, 0, 0), (1, 1, -1)}. A148617

A triangle of polynomial coefficients:p(x,n)=Sum[(k + 1)ⁿ*Binomial[x, k], {k, 0, Infinity}]/2^{x - n}. A176667

Numbers n such that number of runs in the base 3 representation of n is congruent to 0 mod 9. A43806