11488
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 22680
- Proper Divisor Sum (Aliquot Sum)
- 11192
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5728
- Möbius Function
- 0
- Radical
- 718
- Omega Function (Ω)
- 6
- 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
- 55
- 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
- Expansion of (theta_3(q) / theta_4(q) )^4 in powers of q; also of 1 / (1 - lambda(z)).at n=5A014972
- Number of partitions of n with equal number of parts congruent to each of 1 and 3 (mod 5).at n=47A035557
- Number of partitions of n into parts not of the form 25k, 25k+8 or 25k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=34A036007
- McKay-Thompson series of class 14c for Monster.at n=14A058507
- T(n,m) = (1/m!)*Sum_{i=0..m} stirling1(m,i)*(2^i)*(2^i+1)*...*(2^i+n-1).at n=26A059587
- Expansion of phi(q^4) / phi(q) in powers of q where phi() is a Ramanujan theta function.at n=20A112128
- Expansion of elliptic modular function lambda in powers of the nome q.at n=4A115977
- Self-convolution square of A108447.at n=6A118341
- Triangle, read by rows, where diagonals are successive self-convolutions of A108447.at n=42A118343
- Sums of three consecutive hexagonal numbers.at n=43A129109
- Expansion of (phi(q^2) / phi(-q))^2 in powers of q where phi() is a Ramanujan theta function.at n=10A131126
- Expansion of -lambda(t + 1) in powers of the nome q = exp(Pi i t).at n=4A132136
- Number of solutions to the Diophantine equation x1*x2 + x2*x3 + x3*x4 + x4*x5 + x5*x6 = n, with all xi >= 1.at n=55A191832
- Number of (n+1) X 3 0..1 arrays with the number of rightwards and downwards edge increases in each 2 X 2 subblock equal to the number in all its horizontal and vertical neighbors.at n=37A206261
- Expansion of phi(q^4) / phi(-q) in powers of q where phi() is a Ramanujan theta function.at n=20A208933
- Number of 4-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero with no three beads in a row equal.at n=19A208946
- Expansion of (phi(q^2) / phi(q))^2 in powers of q where phi() is a Ramanujan theta function.at n=10A210066
- Least k with precisely n partitions k = x + y satisfying sigma(k) = sigma(x) + sigma(y).at n=14A211224
- Number of (w,x,y) with all terms in {0,...,n} and w != max(|w-x|, |x-y|).at n=22A213501
- Number of rooted planar binary unlabeled trees with n leaves and caterpillar index >= 4.at n=11A214201