Properties of the Number 43440

Forty-Three Thousand Four Hundred Forty

Basics

Value: 43439 → 43440 → 43441

Parity: even

Prime: No

Previous Prime: 43427

Next Prime: 43441

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ⁴ × 3 × 5 × 181

Divisors: 1, 2, 3, 4, 5, 6, 8, 10, 12, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010100110110000

Octal: 124660

Duodecimal: 21180

Hexadecimal: a9b0

Square: 1887033600

Square Root: 208.42264752180844

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 arrangements of n+2 nonzero numbers x(i) in -k..k with the sum of x(i)*x(i+1) equal to zero. A188249

Triangle of coefficients of polynomials v(n,x) jointly generated with A210866; see the Formula section. A210867

Matrix inverse of A111636. A224069

G.f. A(x) satisfies: 1 = ∑_n>=0 (n+1) * 2ⁿ * ((1+x)ⁿ - A(x))ⁿ. A337755

a(n) = A000203(n) * A024916(n). A143238

Number of (w,x,y) with all terms in {0,...,n} and 2∣w-x| >= max(w,x,y)-min(w,x,y). A213388

Number of arrangements of n+2 nonzero numbers x(i) in -6..6 with the sum of x(i)*x(i+1) equal to zero. A188246

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

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

Triangular array read by rows. T(n,k) is the number of ways to choose a size k subset S of [n] and form a labeled acyclic digraph on S. Then form another labeled acyclic digraph on [n]-S. For each pair u in S and v in [n]-S add the directed edge u->v or not, n>=0, 0<=k<=n. A380336