6608
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 14880
- Proper Divisor Sum (Aliquot Sum)
- 8272
- 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
- 2784
- Möbius Function
- 0
- Radical
- 826
- 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
- 93
- 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 e.g.f.: tanh(x)*cos(log(1+x)).at n=8A009824
- Expansion of e.g.f. exp(arcsinh(x)*arcsin(x)).at n=4A012598
- Expansion of e.g.f. cosh(arcsinh(x)*arcsin(x)) in powers of x^4.at n=2A012607
- Expansion of Product_{d | 48} theta_3(q^d).at n=52A033760
- Sort-then-add sequence: a(1) = 316, a(n+1) = a(n) + sort(a(n)).at n=7A033861
- a(0) = 0; for n>0, a(n) = maximal number of regions into which space can be divided by n spheres.at n=28A046127
- Number of regions of linearity for Lusztig's piecewise-linear function in type A_n.at n=4A057565
- Number of elements in the coprime subsets of the integers 1 to n.at n=18A087080
- Numbers m not of the form k*(k+2) that have a single '1' in the periodic part of the continued fraction of sqrt(n).at n=29A102538
- Numbers k such that 4*10^k - 11 is prime.at n=14A102738
- a(n) = Sum {k + j*m <= n} (k + j*m), with 0 < k,j,m <= n.at n=19A106847
- One fourth of fourth column (k=3) of triangle A111999.at n=2A112001
- Riordan array (1/(1-2x), x(1-x)/(1-2x)^2).at n=39A114164
- A Fine number related number triangle.at n=47A124392
- Poincaré series [or Poincare series] P(C^o_{3,2}; x).at n=11A124633
- Triangle read by rows: T(n,k) is the number of binary trees (i.e., a rooted tree where each vertex has either 0, 1, or 2 children; and, when only one child is present, it is either a right child or a left child) with n edges and k pairs of adjacent vertices of outdegree 2.at n=30A126219
- a(n) = n * (n+1)^2 * (3*n^2 + 4*n + 2) / 12.at n=7A132122
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (1, 0, -1), (1, 0, 1), (1, 1, 1)}.at n=7A150716
- Janet periodic table of the elements and structured hexagonal diamond numbers. a(n) = A166911(2*n) + A166911(2*n+1).at n=6A167471
- Number of n X 2 binary arrays with no element equal to the sum mod 3 of its horizontal and vertical neighbors.at n=12A183364