Properties of the Number 11051

Eleven Thousand Fifty-One

Basics

Value: 11050 → 11051 → 11052

Parity: odd

Prime: No

Previous Prime: 11047

Next Prime: 11057

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 43 × 257

Divisors: 1, 43, 257, 11051

Polygonal

Triangular: No

Square: No

Pentagonal: Yes

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10101100101011

Octal: 25453

Duodecimal: 648B

Hexadecimal: 2b2b

Square: 122124601

Square Root: 105.12373661547615

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) = (2ⁿ+1)*(2ⁿ+2)/6. A7581

Array read by antidiagonals downwards: T(b,n) = number of words of length n over an alphabet of size b that are in standard order. A278984

Numbers whose multiset multisystem (A302242) is crossing. A324170

T(n,k)=Number of nXk 0..3 arrays with new values 0..3 introduced in row major order and no element equal to more than one of its immediate leftward or upward or right-upward antidiagonal neighbors. A208872

T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..3 order. A222906

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

Number of set partitions of length <= 4; sum of first 4 columns of triangle of Stirling numbers of 2nd kind; dimension of space of symmetric polynomials in 4 noncommuting variables. A124303

T(n,k) = number of arrays of n 0..k integers with new values introduced in order 0..k but otherwise unconstrained. Array read by antidiagonals. A203647

T(n,k) is the number of n X k 0..3 arrays with new values 0..3 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors). A208353

T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..3 order. A222679