11126
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16692
- Proper Divisor Sum (Aliquot Sum)
- 5566
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5562
- Möbius Function
- 1
- Radical
- 11126
- Omega Function (Ω)
- 2
- 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
- 117
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- Coefficients in expansion of Sum_{n >= 1} x^n/(1-x^n)^4.at n=39A059358
- Number of separate orbits/cycles to which the Catalan bijection A057508 partitions each A000108(n) structures encoded in the range [A014137(n-1)..A014138(n-1)] of the sequence A014486/A063171.at n=10A073193
- a(n) = (9*n^2 - 5*n + 2)/2.at n=50A140064
- Trajectory of 16 under iteration of the map k -> A087712(k).at n=8A144915
- Highest point reached in trajectory of n described in A098282, or -1 if no cycle is ever reached.at n=15A145077
- Highest point reached in trajectory of n described in A098282, or -1 if no cycle is ever reached.at n=25A145077
- Number of compositions of n with no part greater than 3 such that no two adjacent parts are equal.at n=27A155822
- Lexicographically earliest increasing sequence which lists the positions of the zero digits in the sequence.at n=19A167519
- O.g.f.: exp( Sum_{n>=1} -(sigma(2*n^2) - sigma(n^2)) * (-x)^n/n ).at n=29A215603
- Number of n X 3 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 4 binary array having a sum of one, with rows and columns of the latter in lexicographically nondecreasing order.at n=7A227382
- T(n,k)=Number of nXk 0,1 arrays indicating 2X2 subblocks of some larger (n+1)X(k+1) binary array having a sum of one, with rows and columns of the latter in lexicographically nondecreasing order.at n=47A227385
- T(n,k)=Number of nXk 0,1 arrays indicating 2X2 subblocks of some larger (n+1)X(k+1) binary array having a sum of one, with rows and columns of the latter in lexicographically nondecreasing order.at n=52A227385
- First occurrence of 2*n in A035096.at n=45A247234
- a(n) = number of distinct words arising in Post's tag system {00, 1101} applied to the word (100)^n , or a(n) = -1 if this word has an unbounded trajectory.at n=34A302202
- Number of nX4 0..1 arrays with every element equal to 0, 1, 3, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=7A302873
- Number of nXn 0..1 arrays with every element unequal to 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=9A317734
- Numbers with digits in nondecreasing order such that additive and multiplicative digital roots coincide.at n=36A318273
- Expansion of Sum_{k>=1} x^k/(1 + x^k)^4.at n=38A320901
- Numbers m such that A010888(m) = A031347(m) = A031286(m) = A031346(m); only the least of the anagrams are considered.at n=2A357131
- a(n) = Sum_{d|n} (-1)^(n/d-1) * binomial(d+2,3).at n=38A366813