Properties of the Number 21133

Twenty-One Thousand One Hundred Thirty-Three

Basics

Value: 21132 → 21133 → 21134

Parity: odd

Prime: No

Previous Prime: 21121

Next Prime: 21139

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 7 × 3019

Divisors: 1, 7, 3019, 21133

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101001010001101

Octal: 51215

Duodecimal: 10291

Hexadecimal: 528d

Square: 446603689

Square Root: 145.37193676910272

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(n) = floor( n^e ), e = 2.718281828... A61293

a(n) = A000043(n) written in base 4. A161322

Number of partitions of n³ into distinct cubes > 1. A298848

Number of partitions of n into parts not of the form 11k, 11k+2 or 11k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 4 are greater than 1. A35945

Base-8 palindromes that start with 5. A43025

Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k doubledescents (i.e., dd's). A108428

Decimal expansion of 1/129. A21133

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