11109
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
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 17696
- Proper Divisor Sum (Aliquot Sum)
- 6587
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6072
- Möbius Function
- 0
- Radical
- 483
- Omega Function (Ω)
- 4
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = n + (n+1)^2 + (n+2)^3.at n=20A027620
- a(n) = 21*n^2.at n=23A064762
- a(n) = (2*n-1)*(2*n+1)^2.at n=10A102094
- Numbers whose decimal expansion is a concatenation of 3 consecutive decreasing numbers.at n=9A127424
- a(n) = n*(n+2)^2.at n=21A152619
- Second entry in row n of triangle in A169940.at n=26A169943
- Numbers n with property that n^2 contains "1234" as a substring.at n=4A175464
- Forests of k increasing plane unary-binary trees on n nodes. Generalized Stirling numbers of the second kind associated with A185415.at n=31A185422
- a(n) is the smallest number k such that d(1)*1! + d(2)*2! + ... + d(p)*p! = n^2, where d(i) are the decimal digits of k.at n=32A198095
- Triangle of coefficients of polynomials u(n,x) jointly generated with A209768; see the Formula section.at n=53A209767
- a(n) = smallest number k with property that if the base-n expansion of k is reversed, the result is a nontrivial multiple of k.at n=19A224220
- Numbers n such that n^8+8 and n^8-8 are prime.at n=16A239503
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 297", based on the 5-celled von Neumann neighborhood.at n=25A271150
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 529", based on the 5-celled von Neumann neighborhood.at n=6A272747
- a(n) = A277713(n)/3.at n=47A277714
- Number of parts in all partitions of n with largest multiplicity three.at n=29A320373
- a(n) = Sum_{k=0..floor((n-2)/3)} Stirling1(n,3*k+2).at n=8A357836
- Numbers with easy multiplication table - the first 9 multiples of these numbers can be derived by either incrementing or decrementing the corresponding digits from the previous multiple.at n=29A359925
- 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=31A367342
- G.f. A(x) satisfies A(x) = 1 + x*A(x)^3/(1 - x*A(x)^5).at n=6A378883