2208
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 6048
- Proper Divisor Sum (Aliquot Sum)
- 3840
- 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
- 704
- Möbius Function
- 0
- Radical
- 138
- Omega Function (Ω)
- 7
- 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
- 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
- Expansion of x^3*(5-2*x)*(1-x^3)/(1-x)^4.at n=21A000338
- a(n) = a(n-1) + a(n-2) - 1 for n > 1, a(0)=3, a(1)=2.at n=16A001612
- Numbers k such that 3*2^k + 1 is prime.at n=19A002253
- a(n) = ceiling(n*phi^8), where phi is the golden ratio, A001622.at n=47A004963
- a(n) = n*(n+2) = (n+1)^2 - 1.at n=46A005563
- Jordan function J_2(n) (a generalization of phi(n)).at n=46A007434
- Number of planted trees where non-root, non-leaf nodes an even distance from root are of degree 2.at n=14A007562
- Repfigit (REPetitive FIbonacci-like diGIT) numbers (or Keith numbers).at n=10A007629
- Coordination sequence T1 for Zeolite Code ATV.at n=30A008043
- Coordination sequence T9 for Zeolite Code MFI.at n=30A008172
- Coordination sequence T3 for Zeolite Code VNI.at n=29A009909
- Coordination sequence for CaF2(2), Ca position.at n=21A009926
- High-temperature expansion of Ising model susceptibility chi_2 for square lattice.at n=4A010039
- Positive nonsquare integers k such that each term of the regular continued fraction of sqrt(k) divides k.at n=45A013654
- Numbers n such that n is a substring of its square in base 7 (written in base 10).at n=9A018831
- Generalized Catalan Numbers x^2*A(x)^2 -(1-x+x^2+x^3+x^4+x^5)*A(x) + 1 =0.at n=16A023422
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (Lucas numbers), t = A023533.at n=34A024476
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (composite numbers).at n=23A024860
- Coordination sequence T4 for Zeolite Code MWW.at n=31A024989
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = A000032, t = A023533.at n=33A025096