Properties of the Number 43804

Forty-Three Thousand Eight Hundred Four

Basics

Value: 43803 → 43804 → 43805

Parity: even

Prime: No

Previous Prime: 43801

Next Prime: 43853

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 47 × 233

Divisors: 1, 2, 4, 47, 94, 188, 233, 466, 932, 10951

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010101100011100

Octal: 125434

Duodecimal: 21424

Hexadecimal: ab1c

Square: 1918790416

Square Root: 209.29405151604286

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

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X3 or 3X2 subblock having no more than four equal edges, and new values 0..3 introduced in row major order. A206521

G.f.: G(F(x)) is a power series in·consisting entirely of positive integer coefficients such that G(F(x) - x^k) has negative coefficients for k>0, where G(x) = 1 + x·G(x)³ is the g.f. of A001764 and F(x) is g.f. of A251690. A251691

Number of (n+1) X 2 0..3 arrays with every 2 X 3 or 3 X 2 subblock having no more than four equal edges, and new values 0..3 introduced in row major order. A206514

Number of (n+1)X5 0..3 arrays with every 2X3 or 3X2 subblock having no more than four equal edges, and new values 0..3 introduced in row major order. A206517

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

Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite ATO = AlPO4-31 [ Al18P18O72 ]. A18984

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

Number of plane partitions of n with 5 parts. A391659

Numbers n such that there are precisely 11 groups of orders n and n + 1. A295994

Numbers n such that number of runs in the base 3 representation of n is congruent to 6 mod 8. A43804