13992
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 38880
- Proper Divisor Sum (Aliquot Sum)
- 24888
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4160
- Möbius Function
- 0
- Radical
- 3498
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 120
- 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
- a(n) = 2*a(n-1) + a(n-4).at n=13A008999
- Numbers n for which there are exactly seven k such that n = k + reverse(k).at n=27A072431
- Triangle read by rows: T(n,k) is the number of ternary words of length n on {0,1,2} having sum of the lengths of the drops equal to k (n>=0, k>=0). The drops of a ternary word on {0,1,2} are the subwords 10,20 and 21, their lengths being the differences 1, 2 and 1, respectively.at n=53A120907
- Antidiagonal sums of A163280.at n=27A163983
- a(n) = smallest m > 0 such that there are no primes between p*m and p*(m+1) inclusive where p is the n-th prime.at n=24A174741
- T(n,k)=Number of (n+1)X(n+1) 0..k arrays with the array of 2X2 subblock determinants antisymmetric and no off-diagonal 2X2 subblock determinant zero.at n=29A187521
- Number of 3X3 0..n arrays with the array of 2X2 subblock determinants antisymmetric and no off-diagonal 2X2 subblock determinant zero.at n=6A187522
- Array: row n shows the coefficients of the characteristic polynomial of the n-th principal submatrix of f(i,j) = gcd(i+1, j+1) (A204030).at n=29A204111
- a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 1, 1] as of [1, 1, 2].at n=9A211282
- Triangle read by rows: number of 321-avoiding ordered set partitions of [n] into k blocks, n>=1, 1<=k<=n.at n=33A227159
- Number of nX6 0..2 arrays with no element x(i,j) adjacent to value 2-x(i,j) horizontally, diagonally or antidiagonally.at n=2A232918
- T(n,k)=Number of nXk 0..2 arrays with no element x(i,j) adjacent to value 2-x(i,j) horizontally, diagonally or antidiagonally.at n=30A232920
- Number of 3 X n 0..2 arrays with no element x(i,j) adjacent to value 2-x(i,j) horizontally, diagonally or antidiagonally.at n=5A232922
- Number of ways to place 2n rooks on n X n board, 2 rooks in each row and each column, multiple rooks in a cell allowed, and exactly 3 rooks below the main diagonal.at n=3A260575
- Triangle of generalized Eulerian numbers T(n,k) = <n,k>_2 read by rows, n >= 1, 0 <= k < 2*n.at n=28A269742
- Triangle of generalized Eulerian numbers T(n,k) = <n,k>_2 read by rows, n >= 1, 0 <= k < 2*n.at n=32A269742
- a(n) = sum of the perimeters of the Ferrers boards of the partitions of n. Also, sum of the perimeters of the diagrams of the regions of the set of partitions of n.at n=19A278355
- Sum of the odd parts in the partitions of n into 4 parts.at n=44A309517
- Triangle read by rows where T(n,k) is the number of non-isomorphic k-element multisets of nonempty multisets of nonempty multisets (all finite).at n=40A330472
- Number of n-step self-avoiding walks on a 2D square lattice where the first visited lattice point is directly visible from the last visited lattice point, and were only visited lattice points are considered when determining the visibility of points.at n=8A358046