Properties of the Number 33121

Thirty-Three Thousand One Hundred Twenty-One

Basics

Value: 33120 → 33121 → 33122

Parity: odd

Prime: No

Previous Prime: 33119

Next Prime: 33149

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 11 × 3011

Divisors: 1, 11, 3011, 33121

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1000000101100001

Octal: 100541

Duodecimal: 17201

Hexadecimal: 8161

Square: 1097000641

Square Root: 181.99175805513832

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

a(1) = 16, a(n) = smallest number > a(n-1) such that the concatenation of a(n-1) and a(n) is a square. A265154

The number of binary self numbers not exceeding 2ⁿ. A386569

Number of connected cubic graphs of odd girth at least 7 with 2n vertices. A173994

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-3 digits are, in order, the first n terms of the periodic sequence with initial period 1,0,1. A33121

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