2216
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 4170
- Proper Divisor Sum (Aliquot Sum)
- 1954
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1104
- Möbius Function
- 0
- Radical
- 554
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
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
- 19
- 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
- A Fielder sequence: a(n) = a(n-1) + a(n-2) - a(n-6), n >= 7.at n=17A001635
- Absolute value of Glaisher's beta'(2n+1).at n=28A002291
- a(n) = floor(3^n / 2^n).at n=19A002379
- Optimal cost of search tree for searching an ordered array of n elements with cost k of probing element k.at n=31A007077
- Coordination sequence T2 for Zeolite Code ATS.at n=34A008039
- Coordination sequence T5 for Zeolite Code HEU.at n=31A008120
- Coordination sequence T8 for Zeolite Code MFI.at n=30A008171
- [ sqrt(3/2)^n ].at n=38A014215
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = (composite numbers).at n=15A024471
- s(n+3)/4, where s is A024739.at n=9A024740
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Lucas numbers), t = (composite numbers).at n=14A025091
- Numbers k such that Hofstadter Q-sequence Q(k) (A005185) satisfies Q(k) = k/2.at n=29A027619
- Number of similarity classes of triangles which can be drawn using the lattice points in an n X n grid for vertices.at n=11A028492
- Expansion of (theta_3(z)*theta_3(4z)+theta_2(z)*theta_2(4z))^4.at n=36A028585
- Numbers whose base-3 representation has 4 more 0's than 2's.at n=41A031456
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 23.at n=14A031521
- Records for sum of proper divisors function A001065.at n=38A034091
- Composite numbers whose prime factors contain no digits other than 2 and 7.at n=35A036312
- Number of partitions satisfying cn(1,5) + cn(4,5) <= cn(2,5) and cn(1,5) + cn(4,5) <= cn(3,5).at n=35A039876
- Numerators of continued fraction convergents to sqrt(593).at n=5A042136