Properties of the Number 33122

Thirty-Three Thousand One Hundred Twenty-Two

Basics

Value: 33121 → 33122 → 33123

Parity: even

Prime: No

Previous Prime: 33119

Next Prime: 33149

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 16561

Divisors: 1, 2, 16561, 33122

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1000000101100010

Octal: 100542

Duodecimal: 17202

Hexadecimal: 8162

Square: 1097066884

Square Root: 181.99450541156455

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

From George Gilbert's marks problem: jumping 3 marks at a time (initial positions). A19593

a(n) = 14 + floor((1 + ∑_j=1..n-1 a(j))/3). A120158

Number of unimodal negated permutations of the multiset of prime indices of n. A333145

Numerators of continued fraction convergents to sqrt(920). A42778

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

Base-4 digits are, in order, the first n terms of the periodic sequence with initial period 1,0,1. A33122

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