13288
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 27360
- Proper Divisor Sum (Aliquot Sum)
- 14072
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6000
- Möbius Function
- 0
- Radical
- 3322
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 138
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Cake numbers: maximal number of pieces resulting from n planar cuts through a cube (or cake): C(n+1,3) + n + 1.at n=43A000125
- Expansion of 1 / Sum_{n=-oo..oo} x^(n^2).at n=22A004402
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/27 ).at n=26A011937
- Number of overpartitions of n: an overpartition of n is an ordered sequence of nonincreasing integers that sum to n, where the first occurrence of each integer may be overlined.at n=22A015128
- Number of partitions of n that do not contain 5 as a part.at n=37A027339
- Binomial transform of floor(n/2)!.at n=11A081124
- a(n) = (4*n^3 + 6*n^2 + 8*n + 6)/3.at n=21A100504
- a(n) = 2662*n - 22.at n=4A157609
- Numbers k with property that k + Fibonacci(k) is prime.at n=11A175404
- Expansion of 2*x^2 *(4 +7*x +5*x^2 -x^3 -4*x^4 +6*x^6 +4*x^7 -x^8 -2*x^9) / ((1+x)^2 *(1+x+x^2)^2 *(1-x)^4) .at n=42A187062
- Number of 4-step one or two space at a time rook's tours on an n X n board summed over all starting positions.at n=7A187289
- Number of permutations p on the set [n] with the properties that abs(p(i)-i) <= 3 for all i, p(1) <= 3, and p(4) >= 2.at n=10A188491
- Number of 2 X 2 matrices having all terms in {-n,...,0,...,n} and determinant n+1.at n=27A211142
- Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths starting at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 4, n >= 2.at n=49A214022
- Number of Motzkin n-paths avoiding even-numbered steps that are flat steps.at n=15A214938
- Number of partitions of n into distinct parts with boundary size 7.at n=38A227564
- Number of ordered ways to achieve a score of n in American football taking into account different scoring methods.at n=28A237997
- Sum over each antidiagonal of A248017.at n=7A248027
- Number of partitions of n^2 into at most 10 square parts.at n=27A255214
- Irregular triangle read by rows: T(n,m) = number of lattice paths of type B^Q terminating at point (n, m).at n=56A291087