Properties of the Number 33708

Thirty-Three Thousand Seven Hundred Eight

Basics

Value: 33707 → 33708 → 33709

Parity: even

Prime: No

Previous Prime: 33703

Next Prime: 33713

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 53 ²

Divisors: 1, 2, 3, 4, 6, 12, 53, 106, 159, 212

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000001110101100

Octal: 101654

Duodecimal: 17610

Hexadecimal: 83ac

Square: 1136229264

Square Root: 183.597385602301

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 ways to write n as an ordered sum of 6 prime powers (including 1). A341135

Maximal length of rook tour on an n X n board. A6071

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally or vertically. A232431

The Wiener index of a chain of n triangles (i.e., joined like VVV..VV; here V is a triangle!). A143941

T(n,k)=Equals two maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal, diagonal and antidiagonal neighbors in a random 0..3 nXk array. A220959

Expansion of g.f. 1 - 2·x*(-7 - 10·x + x²)/(x - 1)⁴. A152100

Expansion of (1-x)/(1+x+2·x³). A78044

Number of 1X5 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2·n² (number of collections of 1 zero-sum 5-vectors with total modulus squared not more than 2·n², ignoring vector and component permutations). A192692

Number of (n+1)X(3+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally or vertically. A232427

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (-1, 1, 1), (0, 0, 1), (1, 0, 0)}. A149939