2209
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 3
- Divisor Sum
- 2257
- Proper Divisor Sum (Aliquot Sum)
- 48
- 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
- 2162
- Möbius Function
- 0
- Radical
- 47
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 1
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- yes
- 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
- 76
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- no
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- yes
- Achilles Number
- no
- Perfect Power
- yes
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = a(n-1) + a(n-2) - 2, a(0) = 4, a(1) = 3.at n=16A000211
- Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) with a(0)=a(1)=a(2)=1.at n=14A000213
- Number of rooted polyhedral graphs with n edges.at n=8A000287
- A nonlinear recurrence: a(0) = 1, a(1) = 5, a(n) = a(n-1)^2 - 4*a(n-1) + 4 for n>1.at n=4A000324
- Squares that are not the sum of 2 nonzero squares.at n=29A000548
- Squares of primes.at n=14A001248
- Squares of Lucas numbers.at n=8A001254
- Squares of numbers of trees.at n=9A001256
- A Fielder sequence: a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4.at n=16A001638
- Sum of squares of primes dividing n.at n=46A005063
- Sum of squares of odd primes dividing n.at n=46A005066
- Sum of squares of primes = 2 mod 3 dividing n.at n=46A005075
- Sum of squares of primes = 3 mod 4 dividing n.at n=46A005083
- a(n) = C(n+2,3) + C(n,3) + C(n-1,3).at n=16A006004
- Number of restricted circular combinations.at n=14A006499
- Erroneous version of A048798.at n=45A007914
- Coordination sequence T1 for Zeolite Code DOH.at n=29A008078
- Coordination sequence for tridymite, lonsdaleite, and wurtzite.at n=29A008264
- Expansion of e.g.f.: exp(tan(x).exp(x)).at n=6A009248
- Powers of 47.at n=2A009991