Properties of the Number 33008

Thirty-Three Thousand Eight

Basics

Value: 33007 → 33008 → 33009

Parity: even

Prime: No

Previous Prime: 32999

Next Prime: 33013

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ⁴ × 2063

Divisors: 1, 2, 4, 8, 16, 2063, 4126, 8252, 16504, 33008

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000000011110000

Octal: 100360

Duodecimal: 17128

Hexadecimal: 80f0

Square: 1089528064

Square Root: 181.68103918681223

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

Expansion of ∏_n>=1 (1 - x^4·n)/(1 - xⁿ)⁴ in powers of x. A274327

Row sums of triangle A131923. A131924

One fifth of the sum of the first n primes, when an integer. A112271

Expansion of (1 + 4·x + 14·x² + 34·x³ + 63·x⁴ + 80·x⁵ + 87·x⁶ + 68·x⁷ + 42·x⁸ + 20·x⁹ + 7·x¹⁰) / ((1 - x)*(1 - x²)²*(1 - x³)²*(1 - x⁴)). A55384

Triangle read by rows: coefficients of polynomials defined by recursion p(x,n)=(x-γ(n))*p(x,n-1). A136457

Triangle read by rows. Row n gives the coefficients of ∏_k=0..n (x - k!) expanded in decreasing powers of x, with row 0 = {1}. A355540

Number of ways to place 5 nonattacking grasshoppers on a toroidal chessboard of size n·n. A190400

Every run of digits of n in base 10 has length 2. A33008

Number of n X 5 binary arrays with every one adjacent to another one horizontally, diagonally, antidiagonally or vertically. A202792