Properties of the Number 33136

Thirty-Three Thousand One Hundred Thirty-Six

Basics

Value: 33135 → 33136 → 33137

Parity: even

Prime: No

Previous Prime: 33119

Next Prime: 33149

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ⁴ × 19 × 109

Divisors: 1, 2, 4, 8, 16, 19, 38, 76, 109, 152

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000000101110000

Octal: 100560

Duodecimal: 17214

Hexadecimal: 8170

Square: 1097994496

Square Root: 182.03296404772405

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 defective 3-colorings of an n X k 0..2 array connected horizontally, diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order. A229534

Number of solvable clock puzzles with n positions in Final Fantasy XIII-2. A206345

Number of Dyck paths of semilength n such that every peak at level y > 1 is preceded by (at least) one peak at level y-1. A287709

Number of Dean words of length n, i.e., squarefree reduced words over {0,1,2,3}. A343421

Number of defective 3-colorings of an n X 7 0..2 array connected horizontally, diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order. A229533

Number of defective 3-colorings of a 3 X n 0..2 array connected horizontally, diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order. A229536

Number of nX6 0..1 arrays with no element equal to more than two of its horizontal, vertical and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards. A280602

Number of n X n 0..1 arrays with every element unequal to 0, 2, 3, 5 or 8 king-move adjacent elements, with upper left element zero. A305356

Triangle P, read by rows, such that P³ transforms column k of P into column k+1 of P, so that column k of P equals column 0 of P^3·k+1, where P³ denotes the matrix cube of P. A113370

T(n,k)=Number of nXk 0..1 arrays with no element equal to more than two of its horizontal, vertical and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards. A280604