Properties of the Number 33063

Thirty-Three Thousand Sixty-Three

Basics

Value: 33062 → 33063 → 33064

Parity: odd

Prime: No

Previous Prime: 33053

Next Prime: 33071

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 103 × 107

Divisors: 1, 3, 103, 107, 309, 321, 11021, 33063

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000000100100111

Octal: 100447

Duodecimal: 17173

Hexadecimal: 8127

Square: 1093161969

Square Root: 181.83234035781425

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 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically. A207729

Numbers that are the sum of 8 nonzero 8th powers. A3386

G.f.: A(x) = exp( ∑_n>=1 3·A038500(n) * xⁿ/n ), where A038500 is the highest power of 3 dividing n. A161809

Number of nX7 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically. A207728

Number of 4Xn 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically. A207731

Number of (n+2) X (5+2) 0..3 arrays with every 3 X 3 subblock row and column sum not equal to 0 3 5 6 or 7 and every 3 X 3 diagonal and antidiagonal sum equal to 0 3 5 6 or 7. A252251

Number of length n+6 0..2 arrays with at most one downstep in every n consecutive neighbor pairs. A255113

Number of base 13 circular n-digit numbers with adjacent digits differing by 4 or less. A125350

T(n,k)=Number of length n+k 0..2 arrays with at most one downstep in every k consecutive neighbor pairs. A255107

Numbers whose base-12 representation ∑_i=0..m d(i)*12ⁱ has odd d(m-i) for all odd i. A33063