2010
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 3
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 4896
- Proper Divisor Sum (Aliquot Sum)
- 2886
- 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
- 528
- Möbius Function
- 1
- Radical
- 2010
- Omega Function (Ω)
- 4
- 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
- 68
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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 trees of diameter 7.at n=7A000550
- Number of 2n-bead balanced binary necklaces of fundamental period 2n, equivalent to reversed complement; also Dirichlet convolution of b_n=2^(n-1) with mu(n); also number of components of Mandelbrot set corresponding to Julia sets with an attractive n-cycle.at n=11A000740
- a(1)=0, a(2n) = a(n)+1, a(2n+1) = 10*a(n+1).at n=50A001202
- a(n) = solution to the postage stamp problem with 3 denominations and n stamps.at n=29A001208
- Bessel polynomial {y_n}'(-1).at n=5A006199
- Integers written in factorial base.at n=50A007623
- Some permutation of digits is a factorial number.at n=31A007926
- Some nontrivial permutation of digits is a factorial number.at n=25A007927
- Coordination sequence T3 for Zeolite Code AFS and BPH.at n=34A008025
- Coordination sequence T2 for Zeolite Code NAT.at n=30A008204
- a(n) = prime(n)*(prime(n-1)-1)/2.at n=16A014302
- Representation of n in base of Catalan numbers (a classic greedy version).at n=30A014418
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite CHI = Chiavennite Ca4Mn4[Be8Si20O52(OH)8].8H2O starting with a T1 atom.at n=11A019091
- a(n) = position of 3*n^2 in sequence A025051 (numbers of form j*k + k*i + i*j, without repetitions, where 1 <= i <= j <= k).at n=25A025056
- a(n) = A027082(n, n+4).at n=6A027086
- a(n) = A027082(n, 2n-6).at n=7A027093
- Sums of five consecutive squares: a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2 + (n+4)^2.at n=18A027578
- Multiplicity of highest weight (or singular) vectors associated with character chi_109 of Monster module.at n=38A034497
- Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5) < cn(3,5).at n=59A036863
- Number of partitions of n such that cn(0,5) = cn(1,5) < cn(3,5) < cn(2,5) = cn(4,5).at n=68A036876