11090
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
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19980
- Proper Divisor Sum (Aliquot Sum)
- 8890
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4432
- Möbius Function
- -1
- Radical
- 11090
- Omega Function (Ω)
- 3
- 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
- 55
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Fibonacci sequence beginning 2, 10.at n=16A022367
- Decimal part of cube root of a(n) starts with 3: first term of runs.at n=20A034129
- Numbers k such that 80*R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=13A056664
- Interprimes which are of the form s*prime, s=10.at n=25A075285
- Average of terms of n-th row of A077321.at n=39A077325
- Second row of array in A101385.at n=15A101644
- Reduced numerators of the hypercube line-picking integrand sqrt(Pi)*I(n,0).at n=17A103990
- G.f.: Product_{j>=1} Product_{i>=1} (1 + x^(i*j)).at n=25A107742
- Number of permutations of length n which avoid the patterns 2134, 3421, 4132.at n=10A116833
- Number of base 30 circular n-digit numbers with adjacent digits differing by 1 or less.at n=7A124799
- a(n) = 3*a(n-1)+n if a(n-1) is not divisible by 2, or a(n) = a(n-1)/2 otherwise.at n=65A135294
- a(n) = A014486(A154472(n)).at n=1A154473
- Expansion of 1 / Product_{k>=1} (1-x^k-x^(2*k)).at n=17A162891
- Rectangular array A read by upward antidiagonals in which the entry in row n and column k is defined by A(n,k) = A254067(n,k) - A257499(n,k), n,k >= 1.at n=37A254131
- Indices of the start of 9 successive distinct digits in the decimal expansion of Pi.at n=37A258158
- Runs of consecutive integers in A270877, which is produced by a decaying trapezoidal modification of the sieve of Eratosthenes.at n=49A281256
- a(n) = Sum_{1 <= j <= n/2, gcd(j,n)=1} j^3.at n=32A295575
- G.f.: exp( Sum_{n>=1} A020696(n) * x^n/n ), where A020696(n) = Product_{d|n} (d + 1).at n=13A299436
- Numbers k such that k^2 reversed is a prime and k^2+(k^2 reversed) is a prime.at n=22A306301
- Number of series-reduced powerful rooted trees with n nodes.at n=55A318611