13800
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 48
- Divisor Sum
- 44640
- Proper Divisor Sum (Aliquot Sum)
- 30840
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3520
- Möbius Function
- 0
- Radical
- 690
- Omega Function (Ω)
- 7
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 45
- 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
- Normalized total height of all nodes in all rooted trees with n labeled nodes.at n=5A000435
- a(n) = n*(n-1)*(n-2) (or n!/(n-3)!).at n=25A007531
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/22 ).at n=25A011932
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/26 ).at n=26A011936
- Theta series of A*_24 lattice.at n=37A023936
- a(n) = lcm(n,n+1,n+2).at n=22A033931
- Number of ways to place a non-attacking white and black knight on n X n chessboard.at n=10A035289
- Composite numbers k such that k - phi(k) divides sigma(k) - k.at n=10A068418
- Composite n such that n reduced mod(phi(n)) = sigma(n) reduced mod(n).at n=9A068495
- a(n) = (2n+1)*(2n+2)*(2n+3).at n=11A069072
- a(n) = (4*n-1)*4*n*(4*n+1).at n=6A069140
- Integer quotient defining A068418 is 3.at n=3A069737
- Triangle a(n,k) read by rows n which contain columns k=1,2,..,n, where each entry is the product of numbers (k-1)*n-T(k-2)+1 through k*n-T(k-1).at n=25A093447
- a(n) = (3*n-1) * 3*n * (3*n+1).at n=7A097321
- Number of arrangements that can be formed by taking n distinct things out of 25.at n=3A104643
- The r-th term of the n-th row of the following triangle contains product of r successive numbers in decreasing order beginning from T(n)-T(r-1) where T(n) is the n-th triangular number. 1 3 2 6 20 6 10 72 210 24 15 182 1320 3024 120 ... Sequence contains the triangle by rows.at n=23A110768
- a(n) = Sum_{k=0..n} k*C(n,k)^3*C(n+k,k), where C := binomial.at n=4A112036
- a(n) = n*(n-1)*(n-2)*(n-3)*...*(n-k) such that (n-k) is the largest prime smaller than n.at n=24A117481
- Square array T(n, k) = Product_{j=1..n} p(j, k+1), p(n, x) = Sum_{j=0..n} (-1)^j*A053122(n, j)*x^j, and T(n, 0) = n!, read by antidiagonals.at n=59A156603
- a(n) = 1728*n - 24.at n=7A157287