Properties of the Number 21359

Twenty-One Thousand Three Hundred Fifty-Nine

Basics

Value: 21358 → 21359 → 21360

Parity: odd

Prime: No

Previous Prime: 21347

Next Prime: 21377

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 13 × 31 × 53

Divisors: 1, 13, 31, 53, 403, 689, 1643, 21359

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101001101101111

Octal: 51557

Duodecimal: 1043B

Hexadecimal: 536f

Square: 456206881

Square Root: 146.14718608307174

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 of the form HMMSS with primes H < 24 and MM, SS < 60, for which the number of seconds after midnight, 3600·H+60·MM+SS, is also prime. A295011

Triangle read by rows: T(n,k) is number of Dyck n-paths with k UUDDs, 0 <= k <= n/2. A98978

Positive integers i for which A112049(i) == 8. A112068

G.f. A(x) satisfies: Series_Reversion( A(x) + A(x)⁴ ) = A(x) - A(x)⁴. A277294

From George Gilbert's marks problem: jumping 6 marks at a time (final positions). A19996

a(n) = n*(n² + 3·n + 5)/3. A145069

Triangle read by rows: T(n,k) is the number of length n left factors of Dyck paths having k UUDD's, where U=(1,1) and D=(1,-1). A191793

Number of length n left factors of Dyck paths having no UUDD's; here U=(1,1) and D=(1,-1). A191794

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 825", based on the 5-celled von Neumann neighborhood. A273581

The number of peaks of width 1 (i.e., UHD configurations, where U = (0,1), H=(1,0), D=(0,-1)) in all bargraphs of semiperimeter n (n>=2). A273716