Properties of the Number 21835

Twenty-One Thousand Eight Hundred Thirty-Five

Basics

Value: 21834 → 21835 → 21836

Parity: odd

Prime: No

Previous Prime: 21821

Next Prime: 21839

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 5 × 11 × 397

Divisors: 1, 5, 11, 55, 397, 1985, 4367, 21835

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101010101001011

Octal: 52513

Duodecimal: 10777

Hexadecimal: 554b

Square: 476767225

Square Root: 147.76670802315385

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

Starts of runs of 3 consecutive positive negaFibonacci-Niven numbers (A331085). A331087

Expansion of g.f. A(x) satisfying 1 = ∑_n=-oo..+oo (-1)ⁿ * xⁿ * (A(x) + x^4·n-1)ⁿ⁺¹. A363144

Constant term of the reduction by x²->x+1 of the polynomial p(n,x) defined below in Comments. A192748

Numbers n such that n³ contains the consecutive substring 2,3,5,7. A295900

Series expansion for rectilinear polymers on square lattice. A7291

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

Number of partitions satisfying cn(0,5) + cn(2,5) + cn(3,5) <= cn(1,5) + cn(4,5). A39879

Number of nX(n+3) arrays of permutations of n+3 copies of 0..n-1 with every element equal to or 1 greater than any north or northeast neighbors modulo n and the upper left element equal to 0. A267556

Number of 5Xn arrays containing n copies of 0..5-1 with every element equal to or 1 greater than any north or northeast neighbors modulo 5 and the upper left element equal to 0. A267559

Number of states of the Finite State Automaton Gn accepting the language of maximal (or minimal) lexicographic representatives of elements in the positive braid monoid An. A317849