9528
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 23880
- Proper Divisor Sum (Aliquot Sum)
- 14352
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3168
- Möbius Function
- 0
- Radical
- 2382
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 52
- 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
- Series for second parallel moment of hexagonal lattice.at n=5A006737
- Base-5 palindromes that start with 3.at n=38A043008
- a(0)=1; a(1)=1; a(n)= a(n-1) + floor( sqrt(a(n-1)*a(n-2))+ sqrt(a(n-3)*a(n-4))+ ... ).at n=15A043327
- Numbers k such that k | sigma_11(k).at n=26A055715
- Number of homeomorphically irreducible multigraphs (or series-reduced multigraphs or multigraphs without nodes of degree 2) on 4 labeled nodes.at n=14A060534
- Numbers k such that 3*k! + 1 is prime.at n=20A076679
- Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having k UUDD's, where U=(1,1) and D=(1,-1) (0<=k<=floor(n/2), n>=2). A hill in a Dyck path is a peak at level 1.at n=36A105640
- Number of benzenoids with 23 hexagons, C_(2v) symmetry and containing n carbon atoms.at n=13A123142
- G.f.: (2*x+4*x^2+4*x^3+4*x^4+2*x^5)/((1-x)^2*(1-x^2)^3*(1-x^3)^4*(1-x^4)).at n=12A127790
- Let f(i) = prime( f(i - 1) (modulo 10^n) ) with f(0) = 1; a(n) is the length of the period of the sequence f(i).at n=7A128867
- A coefficient tree from the list partition transform relating A111884, A084358, A000262, A094587, A128229 and A131758.at n=22A131202
- Triangle read by rows: T(n,k) = 2^k*A123125(n,k).at n=31A141660
- Number of permutations of 1..n arranged in a circle with exactly 3 adjacent element pairs in decreasing order.at n=5A151576
- Number of permutations of 1..n arranged in a circle with exactly 5 adjacent element pairs in decreasing order.at n=3A151578
- Sequence gives the Poincaré series [or Poincare series] of an ordinal Hodge algebra, or algebra with straightening law, for a ring that the braid group on four strands acts on. It is Cohen-Macaulay.at n=15A156231
- Numbers k such that k^3 +-5 are primes.at n=41A176684
- Number of permutations of [n] realized by the shift on 3 letters.at n=6A192088
- Number of 3X2 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2*n^2 (number of collections of 3 zero-sum 2-vectors with total modulus squared not more than 2*n^2, ignoring vector and component permutations).at n=45A192701
- Number of subsets T of S={0,1,2,...,n-1} such that the closure of T under addition modulo n is S.at n=13A196021
- Number of -n..n arrays x(0..3) of 4 elements with zero sum and no two neighbors equal.at n=11A199706