Properties of the Number 21146

Twenty-One Thousand One Hundred Forty-Six

Basics

Value: 21145 → 21146 → 21147

Parity: even

Prime: No

Previous Prime: 21143

Next Prime: 21149

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 97 × 109

Divisors: 1, 2, 97, 109, 194, 218, 10573, 21146

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101001010011010

Octal: 51232

Duodecimal: 102A2

Hexadecimal: 529a

Square: 447153316

Square Root: 145.41664278891878

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

Number of partitions of n having no more odd than even parts. A171966

Number G(n,k) of set partitions of {1,...,n} into sets of size at most k; triangle G(n,k), n>=0, 0<=k<=n, read by rows. A229223

a(n) = B(n) - 1, where B(n) = Bell numbers, A000110. A58692

Triangle of partial sums of Stirling numbers of 2nd kind (A008277): T(n,k) = ∑_i=1..k Stirling2(n,i), 1<=k<=n. A102661

T(n,k) = number of nonnegative integer arrays of length n+k-1 with new values 0 upwards introduced in order, and containing the value k-1. A211561

a(n) = (1/40320)*8ⁿ + (1/1440)*6ⁿ + (1/360)*5ⁿ + (1/64)*4ⁿ + (11/180)*3ⁿ + (53/288)*2ⁿ + 103/280. Partial sum of Stirling numbers of second kind S(n,i), i=1..8 (i.e., a(n) = ∑_i=1..8 S(n,i)). A99263

T(n,k)=Number of nXk 0..7 arrays with every 2X2 subblock containing exactly one value repeat, and new values 0..7 introduced in row major order. A209527

Triangle read by rows, A008277·A000012. A137650

Permutation trees of power n and height k. A179454

a(n) = 1·4ⁿ + 2·3ⁿ + 3·2ⁿ + 4·1ⁿ. A254030