2162
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
- 3456
- Proper Divisor Sum (Aliquot Sum)
- 1294
- 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
- 1012
- Möbius Function
- -1
- Radical
- 2162
- Omega Function (Ω)
- 3
- 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
- yes
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 138
- 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
- a(n) = (3*n+1)*(3*n+2).at n=15A001504
- Expansion of k/(4*q^(1/2)) in powers of q, where k defined by sqrt(k) = theta_2(0, q)/theta_3(0, q).at n=8A001938
- Oblong (or promic, pronic, or heteromecic) numbers: a(n) = n*(n+1).at n=46A002378
- a(n) = n*phi(n).at n=46A002618
- a(n) = 2*n*(2*n+1).at n=23A002943
- Number of rooted trees with n nodes and omega-valency 1.at n=11A003120
- a(n) = ceiling(n*phi^8), where phi is the golden ratio, A001622.at n=46A004963
- Numbers k such that k^64 + 1 is prime.at n=20A006316
- Coordination sequence T3 for Zeolite Code SGT.at n=29A008231
- Molien series for Weyl group E_8.at n=54A008582
- a(n) = lcm(n, phi(n)).at n=46A009262
- a(0) = 1, a(n) = 15*n^2 + 2 for n>0.at n=12A010005
- Expansion of Product (1 - x^k)^10 in powers of x.at n=15A010818
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ... + a(n-3)*a(3) for n >= 4, with initial terms 1, 1, 2, 2.at n=11A025244
- Sequence satisfies T^2(a)=a, where T is defined below.at n=45A027589
- a(n) = 3*n^2 - 7*n + 6.at n=28A027599
- Sorted Galois numbers.at n=18A028689
- Sorted Galois and Pseudo-Galois numbers.at n=49A028690
- Glaisher's chi_4(n).at n=36A030212
- Number of fixed n-celled polyknights.at n=4A030444