11136
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 30600
- Proper Divisor Sum (Aliquot Sum)
- 19464
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3584
- Möbius Function
- 0
- Radical
- 174
- Omega Function (Ω)
- 9
- 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
- 37
- 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 sin(log(1+sinh(x))).at n=8A009451
- a(n) = floor( n*(n-1)*(n-2)/27 ).at n=68A011909
- a(n) = Sum_{i=1..floor((n+2)/4)} a(2i-1)*a(n-2i+1), with a(1)=a(3)=2 and a(2)=1.at n=12A024959
- Expansion of (theta_3(z)*theta_3(3z)*theta_3(9z)+theta_2(z)*theta_2(3z)*theta_2(9z))^4.at n=42A028705
- Trajectory of 1 under map n->17n+1 if n odd, n->n/2 if n even.at n=7A033965
- Number of partitions in parts not of the form 7k, 7k+2 or 7k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 2 are greater than 1.at n=53A035938
- Configurations of linear chains in a 4-dimensional hypercubic lattice.at n=5A046788
- Number of squares (of another matrix) in the group GL(2,Z_n) described in sequence A000252.at n=19A068516
- Number of squares (of another matrix) in the group GL(2,Z_n) described in sequence A000252.at n=26A068516
- a(n) = n*(20 + 15*n + n^2)/6.at n=35A101853
- Triangle read by rows: T(n,k) is the number of binary sequences of length n containing k subsequences 0101 (n,k>=0).at n=52A118869
- Number of binary sequences of length n containing exactly one subsequence 0101.at n=15A118871
- Partial sum of centered tetrahedral numbers A005894.at n=15A132366
- Lexicographically earliest increasing sequence which lists the positions of the zero digits in the sequence.at n=28A167519
- Fibonacci entry points: a(n) = smallest m such that prime(A075702(n)) divides Fibonacci(m).at n=6A175026
- Numbers with prime signature {7,1,1}, i.e., of form p^7*q*r with p, q and r distinct primes.at n=12A179696
- Triangle read by rows: Partial row sums of A181853(n,k).at n=35A181854
- Number of nondecreasing arrangements of n+2 numbers in 0..8 with the last equal to 8 and each after the second equal to the sum of one or two of the preceding four.at n=21A189325
- The largest integer that cannot be written as the sum of squares of integers larger than n.at n=40A193018
- Value of A114183 at end of n-th doubling run.at n=42A213656