12740
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 33516
- Proper Divisor Sum (Aliquot Sum)
- 20776
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4032
- Möbius Function
- 0
- Radical
- 910
- 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
- 32
- 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
- Expansion of 1/((1+x)*(1-x)^5).at n=25A001752
- Successive integers produced by Conway's PRIMEGAME.at n=37A007542
- a(n) = dot_product(1,2,...,n)*(5,6,...,n,1,2,3,4).at n=30A026043
- Multiplicity of highest weight (or singular) vectors associated with character chi_149 of Monster module.at n=39A034537
- Triangle of rooted planar maps.at n=48A046651
- a(n) = (n+1)*(n+2)*(n+3)*(9n+4)/24.at n=12A051798
- McKay-Thompson series of class 26a for Monster.at n=29A058598
- Triangle read by rows: T(n,m) = C[n,m,m] where C[i,j,k] is the 3-dimensional Catalan pyramid defined by C[0,0,0]=1 and C[i,j,k]=0 if j>i or k>j and C[i,j,k]=C[i-1,j,k]+C[i,j-1,k]+C[i,j,k-1].at n=48A065077
- Numbers k such that sopfr(k)=tau(k).at n=26A078511
- Triangle read by rows: T(n,k) = (2 * (binomial(n,k)) * (n + 2 * k + 3)!)/((k + 1)! * (k + 2)! * (n + 3)!).at n=38A087727
- Numbers n such that n = product (p_k)^(c_k) and set of its (c_k k's)'s is a self-conjugate partition, where p_k is k-th prime and c_k > 0.at n=44A088902
- Triangle read by rows: T(n,k) is the number of nonseparable planar maps with r*n edges and a fixed outer face of r*k edges which are invariant under a rotation of 1/r for any r >= 2 (independent of actual value of r).at n=51A091599
- Average of 4 primes where the integer Schwarzian derivative is zero.at n=16A094903
- Indices of prime Fibonacci 5-step numbers, A001591.at n=14A105756
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(1,1), d=(1,-2) and have k peaks (i.e., ud's).at n=32A108767
- Number triangle T(n,k) = binomial(n,k)*binomial(2n,n-k).at n=32A110608
- a(n) = n^2*(n^2 - 1)/3.at n=14A112742
- Triangle of number of partitions that fit in an n X n box (but not in an (n-1) X (n-1) box) with Durfee square k.at n=40A116647
- Integer squares y from the smallest solutions of y^2 = x*(a^N - x)*(b^N + x) (elliptic line, Weierstrass equation) with a and b legs in primitive Pythagorean triangles and N = 2. Sequence ordered in increasing values of leg a.at n=29A120210
- Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k middle edges (n >= 0, k >= 0).at n=31A120986