11264
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
- 3
Divisibility
- Divisor Count
- 22
- Divisor Sum
- 24564
- Proper Divisor Sum (Aliquot Sum)
- 13300
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5120
- Möbius Function
- 0
- Radical
- 22
- Omega Function (Ω)
- 11
- 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
- 24
- 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) = n*2^(n-1).at n=11A001787
- a(n) = 11*4^n.at n=5A002089
- Numbers of the form 2^i * 11^j.at n=35A003596
- Numbers that are the sum of 11 positive 10th powers.at n=11A004811
- a(n) = 11*2^n.at n=10A005015
- Number of degree-n permutations of order a power of 2.at n=8A005388
- Expansion of eta(q^10)^12/(eta(q^2)^4*eta(q^5)^8) in powers of q.at n=19A006710
- Degrees of irreducible representations of group U6(2).at n=33A008948
- Expansion of cosh(tanh(x))/exp(x).at n=9A009170
- Coordination sequence for Ni2In, Position Ni2.at n=32A009942
- a(n) = lcm(n, 2^(n-1)).at n=10A014964
- a(n) = number of partitions of n into an odd number of parts, the least being 2; also a(n+2) = number of partitions of n into an even number of parts, each >=2.at n=50A027188
- 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 53.at n=23A031551
- a(n) = 11*n^2.at n=32A033584
- Numbers whose prime factors are 2 and 11.at n=18A033848
- Multiplicity of highest weight (or singular) vectors associated with character chi_133 of Monster module.at n=38A034521
- Composite numbers k such that the digits of the prime factors of k are either 1 or 2.at n=44A036302
- Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j)*11^j.at n=37A038217
- Numbers that are divisible by at least 10 primes (counted with multiplicity).at n=36A046313
- Number of permutations of [ n ] with exactly one 132-pattern and two 123-patterns.at n=8A046718