Properties of the Number 11304

Eleven Thousand Three Hundred Four

Basics

Value: 11303 → 11304 → 11305

Parity: even

Prime: No

Previous Prime: 11299

Next Prime: 11311

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ³ × 3 ² × 157

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 18, 24

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10110000101000

Octal: 26050

Duodecimal: 6660

Hexadecimal: 2c28

Square: 127780416

Square Root: 106.3202708800161

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

Triangle read by rows: T(n,k) (n>=1; 1<=k<=n) is the number of permutations of [n] in which the longest increasing run has length k. A8304

a(n) = T(n, n-3), T given by A026519. Also a(n) = number of integer strings s(0), ..., s(n), counted by T, such that s(n) = 3. A26523

a(n) = T(n, n-3), T given by A026552. Also a(n) = number of integer strings s(0), ..., s(n) counted by T, such that s(n) = 3. A26556

Triangle read by rows: T(n,k) = the number of ascending runs of length k in the permutations of [n] for k <= n. A122843

Numbers k such that k and k + 1 are both Niven numbers in base 3/2 (A342426). A342427

a(n) = A341529(n) - A341528(n) = (σ(n)*A003961(n)) - (n*σ(A003961(n))). A341512

T(n,k)=4-loop graph coloring a rectangular array: number of nXk 0..8 arrays where 0..8 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 0,5 5,6 6,0 0,7 7,8 8,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223297

Inverse binomial transform of A088311. A294468

T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3, 4 or 5 king-move adjacent elements, with upper left element zero. A297978

Number of permutations of [n] in which the longest increasing run has length 5. A456