11055
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
- 16
- Divisor Sum
- 19584
- Proper Divisor Sum (Aliquot Sum)
- 8529
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5280
- Möbius Function
- 1
- Radical
- 11055
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 99
- 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
- no
- Odd
- yes
Appears in sequences
- MacMahon's generalized sum of divisors function.at n=42A002127
- Numbers k that divide s(k), where s(1)=1, s(j)=15*s(j-1)+j.at n=40A014865
- Convolution of odd numbers and A001950.at n=22A023659
- Sums of five consecutive squares: a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2 + (n+4)^2.at n=45A027578
- Least term in period of continued fraction for sqrt(n) is 7.at n=19A031431
- Multiplicity of highest weight (or singular) vectors associated with character chi_18 of Monster module.at n=38A034406
- Numbers that are sums of 2 or more consecutive squares in more than 1 way.at n=17A062681
- Numbers n such that p = n^2 + 2, p+2 and p+6 are consecutive primes.at n=20A086380
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n, having k long ascents (i.e., ascents of length at least 2). Rows are of length 1,1,2,2,3,3,... .at n=40A091156
- Let n = a_1a_2...a_k, where the a_i are digits. a(n) = least multiple of n of the type b_1a_1b_2a_2...a_kb_{k+1}, obtained by inserting single digits b_i in the gaps and both ends; 0 if no such number exists.at n=14A110735
- a(1) = a(2) = 1. For n >=3, a(n) = the a(n-2)th integer, among those positive integers which are missing from the first (m-1) terms of the sequence, below a(n-1) if such a positive integer exists. Otherwise, a(n) = the a(n-2)th integer, among those positive integers which are missing from the first (m-1) terms of the sequence, above a(n-1).at n=36A118627
- Multiples of 11 containing an 11 in their decimal representation.at n=33A121031
- Triangle read by rows: T(n,k) is the number of 2-Motzkin paths (i.e., Motzkin paths with blue and red level steps) without red level steps on the x-axis, having length n and k level steps (0 <= k <= n).at n=69A126222
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+313)^2 = y^2.at n=7A129640
- Numbers that are the sum of one or more consecutive squares in more than one way.at n=22A130052
- Odd squarefree numbers n such that the cyclotomic polynomial Phi(n,x) has height 5.at n=33A152943
- a(n) = 49*n^2 + 2*n.at n=14A157365
- Triangle read by rows: a(n,k) = number of permutations in S_n which avoid the pattern 123 and have exactly k descents.at n=62A166073
- Number of Apollonian packings of n circles that are Eulerian and irreducible.at n=15A171090
- Numbers n with property that there is a different number m such that the lunar squares n*n and m*m are the same.at n=40A181319