Properties of the Number 11481

Eleven Thousand Four Hundred Eighty-One

Basics

Value: 11480 → 11481 → 11482

Parity: odd

Prime: No

Previous Prime: 11471

Next Prime: 11483

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 43 × 89

Divisors: 1, 3, 43, 89, 129, 267, 3827, 11481

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10110011011001

Octal: 26331

Duodecimal: 6789

Hexadecimal: 2cd9

Square: 131813361

Square Root: 107.14942836991712

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

Sum of multinomial coefficients (n₁+n₂+...)!/(n₁!*n₂!*...) where (n₁, n₂, ...) runs over all integer partitions of n. A5651

Coordination sequence for (2,6,infinity) tiling of hyperbolic plane. A265070

a(n) = n*(n² - 6·n + 11)/6. A50407

Number T(n,k) of partitions of n where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order and all k letters occur at least once in the partition; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A261719

a(n) = B(2n,3)/B(2n) (see comment). A96046

Irregular triangular array, read by rows: T(n,k) is the sum of the products of multinomial coefficients (n₁ + n₂ + n₃ + ...)!/(n₁! * n₂! * n₃! * ...) taken k at a time, where (n₁, n₂, n₃, ...) runs over all integer partitions of n (n >= 0, 0 <= k <= A000041(n)). A309951

a(n) = (3 + 2·n + 6·n² + 4·n³)/3. A166464

Centered 14-gonal numbers. A69127

Number of distinct values taken by the entropy for permutations of [1..n], where the entropy of a permutation π is ∑_k=1..n (π(k)-k)². A126972

Number T(n,k) of colored integer partitions of n using all colors of a k-set such that parts i have distinct color patterns in arbitrary order and each pattern for a part i has i colors in (weakly) increasing order; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A309973