11105
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13332
- Proper Divisor Sum (Aliquot Sum)
- 2227
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8880
- Möbius Function
- 1
- Radical
- 11105
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 192
- 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
- no
- Odd
- yes
Appears in sequences
- Number of partitions of n into parts not of the form 13k, 13k+4 or 13k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 5 are greater than 1.at n=38A035952
- Numbers k for which 10*2^k + 3 is a prime (giving terms of A068712).at n=48A068713
- Row sums of the triangle described in A082200.at n=19A082203
- Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 11100-00100-00111 pattern in any orientation.at n=11A147254
- Number of lower triangles of a 3 X 3 0..n array with each element differing from all of its diagonal, vertical, antidiagonal and horizontal neighbors by two or less.at n=11A195249
- Numbers of the form ((6k+5)^2+9)/2 or 2(3k+4)^2-9.at n=48A214493
- Number T(n,k) of linear chord diagrams having n chords and minimal chord length k (or k=0 if n=0); triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=31A293881
- Number of linear chord diagrams having n chords and minimal chord length three.at n=4A293916
- A331757(n)/2.at n=15A331758
- Number of partitions of n into 10 or more distinct parts.at n=36A347577
- Square array T(n, k) (n>=1, k>=1) read by antidiagonals upwards. T(n, k) is the number of partitions of the set [n] into lists of k noncrossing sets.at n=49A348702
- Sum of numerator and denominator in a rational approximation j/k of q = log(2)/log(3), such that q - j/k is a new minimum, i.e., q is approximated from below.at n=17A355514
- 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=27A367342
- Consecutive states of the linear congruential pseudo-random number generator (430*s + 2531) mod 11979 when started at s=1.at n=5A384431
- Number of integer partitions of n with all equal lengths of maximal runs of consecutive parts decreasing by 1 but not by 0.at n=45A384904