Properties of the Number 21050

Twenty-One Thousand Fifty

Basics

Value: 21049 → 21050 → 21051

Parity: even

Prime: No

Previous Prime: 21031

Next Prime: 21059

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 2 × 5 ² × 421

Divisors: 1, 2, 5, 10, 25, 50, 421, 842, 2105, 4210

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 101001000111010

Octal: 51072

Duodecimal: 10222

Hexadecimal: 523a

Square: 443102500

Square Root: 145.08618128546908

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

Numbers k such that k | 13^k + 1. A15963

"DHK[ 5 ]" (bracelet, identity, unlabeled, 5 parts) transform of 1,1,1,1,... A32246

Triangle T(n,k), n>=1, read by rows, where T(n,k) is the number of lattice polygons with area n and perimeter 2·k. A8855

Number of rectangular plane partitions of n with strictly decreasing rows and columns. A323430

Number of n-celled polygons with perimeter 2n+2 on square lattice. A6725

Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 5, n >= 2. A214563

Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 6, n >= 2. A214601

Number of partitions of n into distinct parts with boundary size 7. A227564

Cumulative sum of quintuple factorial numbers n!!!!! (A085157). A114805

a(n) = floor(n*(n+2)*(n+4)*(n-6)/192). A117652