12660
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 35616
- Proper Divisor Sum (Aliquot Sum)
- 22956
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3360
- Möbius Function
- 0
- Radical
- 6330
- Omega Function (Ω)
- 5
- 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
- 81
- 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
- Triangle of number of permutations of [n] with 0 successions, by number of rises.at n=31A046740
- Number of directed multigraphs with loops on 3 nodes with n arcs.at n=11A050927
- Third diagonal of triangle in A046740.at n=5A065340
- Coefficients in a certain Poincaré series [or Poincare series].at n=27A098705
- Triangle read by rows: T(n,0)=1, T(n,n)=1, T(n, k) = 2*(n-k)*T(n-1, k-1) + 2*k*T(n-1, k).at n=30A099759
- Triangle read by rows: T(n,0)=1, T(n,n)=1, T(n, k) = 2*(n-k)*T(n-1, k-1) + 2*k*T(n-1, k).at n=33A099759
- a(n) = (n+1)*binomial(2n+2,n+1)-3*4^n+binomial(2n,n).at n=5A112328
- Number of partitions of n into terms of (1,2)-Ulam sequence, cf. A002858.at n=47A199016
- Number of 2 X 2 matrices having all elements in {-n,...,n} and determinant 1.at n=36A209982
- Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and -1<=w+x+y<=1.at n=38A211615
- Sum over all partitions lambda of n of Sum_{p:lambda} p^m(p,lambda), where m(p,lambda) is the multiplicity of part p in lambda.at n=18A213180
- Number of compositions of n having exactly eight fixed points.at n=13A240743
- a(n) = prime(n+1)^2 - prime(n).at n=28A261465
- Triangle read by rows, T(n,k) = Sum_{j=0..n} C(-j,-n)*E1(j,k), E1 the Eulerian numbers A173018, for n>=0 and 0<=k<=n.at n=51A271698
- Number of increasing runs in all Carlitz compositions of n.at n=16A285994
- Sum of the corners of a 2n+1 X 2n+1 square spiral.at n=27A325958
- Number of distinct edges among all circles that can be constructed on vertices of an n-sided regular polygon, using only a compass.at n=14A359047
- Consecutive states of the linear congruential pseudo-random number generator (10924*s+11830) mod (2^15+1) when started at s=1.at n=26A384150