Properties of the Number 33804

Thirty-Three Thousand Eight Hundred Four

Basics

Value: 33803 → 33804 → 33805

Parity: even

Prime: No

Previous Prime: 33797

Next Prime: 33809

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ³ × 313

Divisors: 1, 2, 3, 4, 6, 9, 12, 18, 27, 36

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000010000001100

Octal: 102014

Duodecimal: 17690

Hexadecimal: 840c

Square: 1142710416

Square Root: 183.85864135253476

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 nXk arrays of the minimum value of corresponding elements and their horizontal, vertical or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 nXk array. A220204

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero. A299721

G.f.: ∏_n>=1 ((1-xⁿ)/(1+xⁿ))^2·n. A216406

The Wiener index of the double-comb graph \/_\/_\/...\/_\/ with 3n (n>=1) nodes. The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices in the graph. A192025

Number of (n+2) X 3 binary arrays avoiding patterns 001 and 110 in rows, columns and nw-to-se diagonals. A202440

Number of 3Xn arrays of the minimum value of corresponding elements and their horizontal, vertical or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 3Xn array. A220206

Number of nX3 0..1 arrays with every element equal to 0, 2, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero. A299716

Number of nX7 0..1 arrays with every element equal to 0, 2, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero. A299720

Number of nX7 arrays of the minimum value of corresponding elements and their horizontal, vertical or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 nX7 array. A220203

Product t2(q^d); d | 45, where t2 = theta2(q)/(2·q^1/4). A33804