2227
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 2376
- Proper Divisor Sum (Aliquot Sum)
- 149
- 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
- 2080
- Möbius Function
- 1
- Radical
- 2227
- Omega Function (Ω)
- 2
- 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
- 138
- Smith Number
- yes
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Number of minimal plane trees with n terminal nodes.at n=41A006241
- Numbers k for which 10k+1, 10k+3, 10k+7 and 10k+9 are primes.at n=19A007811
- Coordination sequence T2 for Zeolite Code AFY.at n=39A008030
- Coordination sequence T4 for Zeolite Code VNI.at n=29A009910
- Expansion of 1/(1-x^7-x^8-x^9-x^10-x^11-x^12-x^13).at n=49A017862
- Numbers k such that the continued fraction for sqrt(k) has period 34.at n=20A020373
- a(n) = a(n-1) + a(n-2) + 1, with a(0)=3, a(1)=12.at n=12A022411
- Indices of primes of form 3^p - 2.at n=4A022603
- Place where n-th 1 occurs in A023133.at n=37A022795
- a(n) = L(n+1) + c(n) where L(k) = k-th Lucas number and c(n) is n-th number that is 1 or not a Lucas number.at n=14A022802
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th non-Fibonacci number).at n=13A023487
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th non-Lucas number).at n=13A023495
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (1, p(1), p(2), ...).at n=43A024369
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (primes).at n=42A024377
- Duplicate of A024377.at n=42A025069
- a(n) = A027113(n, 2n-4).at n=7A027122
- a(n) = Sum_{k divides 3^n} S(k), where S is the Kempner function A002034.at n=45A029714
- Graham-Sloane-type lower bound on the size of a ternary (n,3,4) constant-weight code.at n=17A030504
- 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=1A031545
- Concatenation of n and n + 5 or {n,n+5}.at n=21A032610