11732
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 23520
- Proper Divisor Sum (Aliquot Sum)
- 11788
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 5016
- Möbius Function
- 0
- Radical
- 5866
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 99
- 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
- a(n) = Sum_{k=0..n} p(k) where p(k) = number of partitions of k (A000041).at n=26A000070
- Number of palindromic partitions of n.at n=52A025065
- Number of palindromic partitions of n.at n=53A025065
- Number of proper factorizations of p1^n*p2^2, where p1 and p2 are distinct primes.at n=21A031125
- Number of nonisomorphic systems of catafusenes for the unsymmetrical schemes (group C_s) with two appendages (see references for precise definition).at n=7A045445
- Triangular array related to Motzkin triangle A026300.at n=34A084536
- Triangle read by rows: T(n,k) = number of lattice paths from (0,0) to (n,k) that do not go below the line y=0 and consist of steps U=(1,1), D=(1,-1) and three types of steps H=(1,0) (left factors of 3-Motzkin steps).at n=29A091965
- Number of partitions of n with at most one odd part.at n=53A100824
- a(n) = 343*n - 273.at n=34A157369
- Wiener index of the Moebius ladder M(n).at n=27A180857
- Generalized Riordan array based on the binomial transform of the Fine's numbers A000957.at n=48A187914
- Number of partitions of n having (sum of odd parts) < (sum of even parts).at n=38A239259
- Number of partitions of n having (sum of odd parts) <= (sum of even parts).at n=38A239260
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=47A250783
- Number of (3+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=7A250785
- Number of partitions of n containing no part i of multiplicity i.at n=36A276429
- Expansion of Product_{k>=1} (1 - x^k)^(k-1).at n=41A319108
- Number of even-length integer partitions of n with at most one odd part in the conjugate partition.at n=55A349149
- Expansion of 1 / Sum_{k in Z} x^k / (1 - x^(5*k+1)).at n=45A375062