2332
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 4536
- Proper Divisor Sum (Aliquot Sum)
- 2204
- 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
- 1040
- Möbius Function
- 0
- Radical
- 1166
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 32
- 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
- Number of n-step self-avoiding walks on cubic lattice ending at point with x=2.at n=4A000761
- Related to S(n), the number of self-dual monotone Boolean functions of n variables (A001206): 2^n-th term is S(n).at n=28A001087
- Number of permutations of length n with longest increasing subsequence of length 3.at n=4A001454
- Coordination sequence T3 for Zeolite Code DAC.at n=30A008069
- a(n) = sum of the numbers between the two n's in A026284.at n=43A026287
- a(n) = Sum_{i=0..2*n} Sum_{j=0..n-1} A026519(j, i).at n=8A026534
- a(n) = n*(n + 9).at n=44A028569
- Palindromes of form k*(k+9).at n=3A028571
- Concatenation of n and n + 9 or {n,n+9}.at n=22A032614
- Numbers using only digits 2 and 3.at n=20A032810
- Numbers whose set of base-8 digits is {3,4}.at n=27A032832
- Nonsquarefree palindromes.at n=44A035132
- Number of partitions of n into parts 5k+1 or 5k+3.at n=53A035372
- Limit of the position of the n-th partition into parts 5k+2 or 5k+3 in the list of all integer partitions sorted in reverse lexicographic order, for integers == 3 (mod 5).at n=41A035408
- Number of partitions of n into parts not of form 4k+2, 24k, 24k+3 or 24k-3. Also number of partitions in which no odd part is repeated, with 1 part of size less than or equal to 2 and where differences between parts at distance 5 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=41A036030
- Numbers whose maximal base-6 run length is 4.at n=13A037987
- Denominators of continued fraction convergents to sqrt(452).at n=6A041861
- Base-10 palindromes that start with 2.at n=15A043037
- Numbers having four 4's in base 6.at n=1A043388
- Numbers having three 4's in base 8.at n=11A043439