12624
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
- 4
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 32736
- Proper Divisor Sum (Aliquot Sum)
- 20112
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4192
- Möbius Function
- 0
- Radical
- 1578
- Omega Function (Ω)
- 6
- 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
- no
- 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
- Number of chiral planted trees with n nodes.at n=12A005628
- Number of achiral polyominoes with n cells.at n=17A030227
- Concatenate factorials.at n=3A045508
- Number of chiral pairs of necklaces with n beads and two colors (color complements being equivalent); i.e., turning the necklace over neither leaves it unchanged nor simply swaps the colors.at n=20A059053
- T(n,k) = right- or upward-moving paths connecting opposite corners of an n X n chessboard, visiting the diagonal at k points between start and finish.at n=23A075435
- Numbers whose set of base 5 digits is {0,4}.at n=39A097251
- Sum of primes p with n^2 < p < (n+1)^2.at n=34A108314
- Number of disconnected 2-regular graphs on n vertices.at n=53A165652
- Dispersion of (4*n-floor(n*sqrt(2))), by antidiagonals.at n=56A191537
- Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two, four or six distinct values for every i,j,k<=n.at n=7A211574
- Number of (n+1)X(1+1) 0..2 arrays colored with the maximum plus the upper median minus the minimum of every 2X2 subblock.at n=3A237385
- Number of (n+1) X (4+1) 0..2 arrays colored with the maximum plus the upper median minus the minimum of every 2 X 2 subblock.at n=0A237388
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the maximum plus the upper median minus the minimum of every 2X2 subblock.at n=6A237391
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the maximum plus the upper median minus the minimum of every 2X2 subblock.at n=9A237391
- Number of length 3 1..(n+1) arrays with every leading partial sum divisible by 2, 3, 5, 7 or 11.at n=28A254950
- Numbers k such that 6*R_k + 7*10^k + 1 is prime, where R_k = 11...11 is the repunit (A002275) of length k.at n=8A259133
- Expansion of Sum_{i>=1} mu(i)^2*x^i/(1 - x^i) / Product_{j>=1} (1 - mu(j)^2*x^j), where mu() is the Moebius function (A008683).at n=27A281572
- a(n) = Sum_{k=0..floor(n/3)} (-1)^k * binomial(2*n-6*k,n-3*k).at n=8A360186
- Row lengths of irregular triangle A381587.at n=22A381357