11104
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 21924
- Proper Divisor Sum (Aliquot Sum)
- 10820
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5536
- Möbius Function
- 0
- Radical
- 694
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 130
- 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
- Aliquot sequence starting at 180.at n=17A008891
- Sum of (Gaussian) q-binomial coefficients for q=-11.at n=4A015176
- Numbers k such that the continued fraction for sqrt(k) has period 92.at n=24A020431
- Numbers k that divide the (left) concatenation of all numbers <= k written in base 3 (most significant digit on left).at n=7A029472
- Number of asymmetric connected graphs where every block is a complete graph.at n=15A035080
- Triangular array T(n,k) giving number of weakly connected digraphs with n labeled nodes and k arcs (n >= 1, 0 <= k <= n(n-1)).at n=29A062735
- Numbers k such that 2^k mod phi(k) = 2^phi(k) mod k.at n=45A069050
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k pyramids (a pyramid is a sequence u^pd^p or U^pd^(2p) for some positive integer p, starting at the x-axis).at n=41A108445
- Non-plane increasing unary binary (0-1-2) trees where the nodes of outdegree 1 come in 2 colors.at n=7A131178
- Triangle, read by rows, where row n equals row n of matrix power A132844^n for n>=0, where triangle A132844 is defined by: A132844(n,k) = T( [(n+k)/2], k) for n>=k>=0.at n=39A132845
- Column 3 of triangle A132845.at n=5A132849
- Integers k such that 10^k + 61 is a prime number.at n=13A135116
- Antidiagonal sums of the convolution array A213774.at n=11A213776
- Numbers k such that k divides 1 + Sum_{j=1..k} prime(j)^9.at n=13A232964
- Number of alpha-labeled graphs with n edges and at most n vertices.at n=8A245519
- Number of pairs of endofunctions f, g on [n] satisfying f(g^6(i)) = f(i) for all i in [n].at n=4A245915
- Expansion of Product_{k>=1} 1 / ((1-x^(3*k-1))^(3*k-1) * (1-x^(3*k-2))^(3*k-2)).at n=19A262923
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 873", based on the 5-celled von Neumann neighborhood.at n=20A273709
- a(n) = n+1 for n = 1 to 8; a(n) = 100 + a(n-8) for n = 9 to 16; thereafter a(8*i+j) = 10^(i+1) + a(8*(i-1)+j) for i >= 2, 1 <= j <= 8.at n=26A367342