Properties of the Number 13170

Thirteen Thousand One Hundred Seventy

Basics

Value: 13169 → 13170 → 13171

Parity: even

Prime: No

Previous Prime: 13163

Next Prime: 13171

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5 × 439

Divisors: 1, 2, 3, 5, 6, 10, 15, 30, 439, 878

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11001101110010

Octal: 31562

Duodecimal: 7756

Hexadecimal: 3372

Square: 173448900

Square Root: 114.76062042355818

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) = (3·n⁵ - 35·n⁴ + 145·n³ - 235·n² + 152·n + 30)/30. A161704

T(n,k)=Number of nXk 0..2 arrays with every 0 next to a 1 and every 1 next to a 2 horizontally or antidiagonally, with no adjacent elements equal. A232335

Sum of the first moments of all partitions of n with weights starting at 0. A66185

a(n) = floor((-1)ⁿ*n!*(E(n,2)-E(n,1)*E(n-1,1))) where E(n,x) = ∑_k=0..n (-1)^k*x^k/k!. A65955

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 0 1 2 7 8 or 9. A252590

Square array A(n, k) = A294898(A246278(n, k)), read by falling antidiagonals; Difference A005187(n)-A000203(n) applied to the prime shift array. A379008

Triangle read by rows: T(n,k) is the coefficient of (1+x)^k in the ZZ polynomial of the hexagonal graphene flake O(3,3,n). A338217

Exponential self-convolution of numbers of trees on n nodes. A6771

Number of primitive (aperiodic) step shifted (decimated) sequences using a maximum of five different symbols. A56384

Triangle T(n,k) of series-reduced (or homeomorphically irreducible) graphs with loops on n labeled nodes and with k edges, k=0..binomial(n+1,2). A60517