Properties of the Number 33213

Thirty-Three Thousand Two Hundred Thirteen

Basics

Value: 33212 → 33213 → 33214

Parity: odd

Prime: No

Previous Prime: 33211

Next Prime: 33223

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 11071

Divisors: 1, 3, 11071, 33213

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000000110111101

Octal: 100675

Duodecimal: 17279

Hexadecimal: 81bd

Square: 1103103369

Square Root: 182.2443414759427

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 factorizations of mⁿ into 3 factors, where m is a product of exactly 3 distinct primes and each factor is a product of n primes (counted with multiplicity). A257464

Primes of form x²+17·y². A33213

Number of (binary) heaps of length n-k whose element set equals [k], where k is chosen so as to maximize this number. A373897

Number of (binary) heaps of length n whose element set equals {1,2,3}. A376962

The number of ways to color n balls in a row with 3 colors with no color runs having lengths greater than 4. This sequence is a special case of the general problem for coloring n balls in a row with p colors where each color has a given maximum run-length. In this example, the bounds are uniformly 4. It can be phrased in terms of tossing a p-faced die n times, requiring each face to have no runs longer than b. A181140