2224
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 4340
- Proper Divisor Sum (Aliquot Sum)
- 2116
- 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
- 1104
- Möbius Function
- 0
- Radical
- 278
- Omega Function (Ω)
- 5
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 45
- 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
- Sum of cubes of primes dividing n.at n=38A005064
- Sum of cubes of odd primes dividing n.at n=38A005067
- Centered triangular numbers: a(n) = 3*n*(n-1)/2 + 1.at n=38A005448
- Number of 4-connected polyhedral graphs with n nodes.at n=8A007027
- Coordination sequence T4 for Zeolite Code BRE.at n=31A008061
- Coordination sequence T1 for Zeolite Code KFI.at n=36A008123
- Coordination sequence T11 for Zeolite Code MFI.at n=30A008163
- Triangle read by rows: T(n,k) is one-half the number of permutations of length n with exactly n-k rising or falling successions, for n >= 1, 1 <= k <= n. T(1,1) = 1 by convention.at n=39A010028
- Partial sums of A003136.at n=41A014146
- Numbers k such that 3^k - 2 is prime.at n=20A014224
- Binomial transform of Thue-Morse sequence A010059.at n=12A019301
- Numbers k such that the continued fraction for sqrt(k) has period 32.at n=32A020371
- a(0)=0, a(2*n) = 2*a(n) + 2*a(n-1) + n^2 + n, a(2*n+1) = 4*a(n) + (n+1)^2.at n=39A022560
- n-th 8k+1 prime plus n-th 8k+7 prime.at n=43A022761
- a(n) = L(n+2) + c(n) where L(k) is the k-th Lucas number and c(n) is the n-th number that is 1 or 3 or is not a Lucas number.at n=13A022810
- a(n) = T(n,n-3), where T is the array in A026386.at n=15A026394
- a(n) = position of the n-th n in A026409.at n=43A026412
- 1 together with numbers of the form p*q^4 and p^9, where p and q are distinct primes.at n=44A030628
- Numbers k such that the continued fraction for sqrt(k) has even period 2*m and the m-th term of the periodic part is 5.at n=45A031408
- Concatenation of n and n + 2 or {n,n+2}.at n=21A032607