Properties of the Number 33131

Thirty-Three Thousand One Hundred Thirty-One

Basics

Value: 33130 → 33131 → 33132

Parity: odd

Prime: No

Previous Prime: 33119

Next Prime: 33149

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 7 × 4733

Divisors: 1, 7, 4733, 33131

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000000101101011

Octal: 100553

Duodecimal: 1720B

Hexadecimal: 816b

Square: 1097663161

Square Root: 182.01922975334227

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 strict compositions of n with all adjacent parts (x, y) satisfying x < 2y and y < 2x. A342341

Expansion of e.g.f. exp(exp(-x)/(1 - x) - 1). A321989

a(n) = 49·n² + 7. A158481

List of primitive words over the alphabet {1,3}. A213970

Replacing each digit d in decimal expansion of n with d² yields a prime at each step when done recursively three times. A316604

Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 52. A31730

Number T(n,k) of partitions of n with largest part k where each block of part i with multiplicity j is marked with a word of length i·j over an n-ary alphabet whose letters appear in alphabetical order and all n letters occur exactly once in the partition; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A364285

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

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