2243
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
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 2244
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 2242
- Möbius Function
- -1
- Radical
- 2243
- Omega Function (Ω)
- 1
- 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
- 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
- 45
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 334
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that phi(2k-1) < phi(2k), where phi is Euler's totient function A000010.at n=32A001836
- Coordination sequence T2 for Zeolite Code CAS.at n=29A008064
- Coordination sequence T1 for Scapolite.at n=30A008262
- Expansion of (1+x)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=50A008762
- a(n) is prime and sum of all primes <= a(n) is prime.at n=35A013917
- Expansion of Molien series for automorphism group (2.Weyl(E6)) of E6 lattice.at n=43A014977
- Coordination sequence T1 for Zeolite Code OSI.at n=31A016430
- a(n+1) (n >= 1) is smallest number > a(n) which is the sum of cubes of distinct earlier terms.at n=44A019511
- a(n) = S(n) + c(n) where S(n) = [ (3/2)^n ] and c is the complement of S.at n=18A022808
- Primes that remain prime through 2 iterations of function f(x) = 3x + 8.at n=31A023248
- Primes that remain prime through 3 iterations of function f(x) = 6x + 5.at n=25A023288
- a(n+1) = a(n) converted to base 8 from base 5 (written in base 10).at n=8A023381
- Convolution of Fibonacci numbers and A000201.at n=12A023611
- a(n) = least m such that if r and s in {1/2, 1/5, 1/8, ..., 1/(3n-1)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=21A024837
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+2)/m < s for some integer k.at n=20A024842
- Number of connected functions on n points with a loop of length 4.at n=8A029853
- Positions of record values in A030777.at n=42A030782
- a(n) = prime(8*n - 2).at n=41A031382
- 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 47.at n=4A031545
- a(n) = prime(10*n - 6).at n=33A031914