Properties of the Number 43284

Forty-Three Thousand Two Hundred Eighty-Four

Basics

Value: 43283 → 43284 → 43285

Parity: even

Prime: No

Previous Prime: 43283

Next Prime: 43291

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 3607

Divisors: 1, 2, 3, 4, 6, 12, 3607, 7214, 10821, 14428

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010100100010100

Octal: 124424

Duodecimal: 21070

Hexadecimal: a914

Square: 1873504656

Square Root: 208.04807136813358

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

Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which represent a six-fold rotation. Also the sequence for the corresponding six-fold rotoinversions. A53174

Triangle read by rows: T(n,k) is the coefficient of (1+x)^k in the ZZ polynomial of the hexagonal graphene flake O(3,3,n). A338217

Number of 0..n arrays x(0..6) of 7 elements with zero 6th difference. A200158

Number of n X 6 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than one of its immediate leftward or upward or right-upward antidiagonal neighbors. A208635

Number of 7 X n 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than one of its immediate leftward or upward or right-upward antidiagonal neighbors. A208642

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

Triangle T(n,m) read by rows: ∑_k=1..m binomial(2·n, n+k)*d(k), m<=n, with d(k)=A000005(k). A351145

T(n,k) = number of 0..k arrays x(0..n-1) of n elements with zero (n-1)-st difference. A200154

T(n,k)=Number of nXk 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than one of its immediate leftward or upward or right-upward antidiagonal neighbors. A208637

Maximal run length in base-10 representation of n. A43284