11752
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 23940
- Proper Divisor Sum (Aliquot Sum)
- 12188
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5376
- Möbius Function
- 0
- Radical
- 2938
- Omega Function (Ω)
- 5
- 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
- 50
- 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
- Coordination sequence for D_5 lattice.at n=5A008355
- a(n) = Sum_{k=0..2n-1} T(n,k) * T(n,k+1), with T given by A026568.at n=5A027278
- Coordination sequence for lattice D*_4 (with edges defined by l_1 norm = 1).at n=13A035471
- Number of upward triangles in a Star of David matchstick arrangement of size n.at n=13A045950
- McKay-Thompson series of class 40C for Monster.at n=47A058664
- Number of orbits of length n under a map whose periodic points seem to be counted by A006953.at n=32A060171
- Numbers n such that zero is never reached by iterating the mapping k -> abs(reverse(lpd(k))-reverse(gpf(k))). lpd(k) is the largest proper divisor and gpf(k) is the largest prime factor of k.at n=30A076425
- a(n) = Sum_{k=0..n} (-1)^(n-k)*A000041(k).at n=37A087787
- For a given unrestricted partition pi, let P(pi)=lambda(pi), if mu(pi)=0. If mu(pi)>0 then let P(pi)=nu(pi), where nu(pi) is the number of parts of pi greater than mu(pi), mu(pi) is the number of ones in pi and lambda(pi) is the largest part of pi.at n=36A100818
- Square array T(n,k) read by antidiagonals: coordination sequence for lattice D_n.at n=26A103903
- G.f.: A(x) = ( G(x)^7 - G(x^7) - 7*x*((1-x^6)/(1-x))/(1-x^7) )/(49*x^2) where G(x) is the g.f. of A110635.at n=9A111584
- Poincaré series [or Poincare series] P(T_{4,2}; x).at n=10A124616
- Number of 2's in the last section of the set of partitions of n.at n=39A182712
- Number of 2's in all partitions of 2n+1 that do not contain 1 as a part.at n=19A182717
- Number of 3-step knight's tours on an (n+2) X (n+2) board summed over all starting positions.at n=14A186852
- Number of 5-step one space leftwards or up, two space rightwards or down asymmetric rook's tours on an n X n board summed over all starting positions.at n=9A187300
- Number of solutions to the Diophantine equation x1*x2 + x2*x3 + x3*x4 + x4*x5 + x5*x6 = n, with all xi >= 1.at n=56A191832
- Number of -n..n arrays x(0..3) of 4 elements with zero sum, and adjacent elements not equal modulo three (with -1 modulo 3 = 2).at n=18A199911
- Number of partitions of n containing at least one part m-3 if m is the largest part.at n=38A212543
- Number of length n+5 0..3 arrays with at most two downsteps in every 5 consecutive neighbor pairs.at n=1A255657