11107
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11520
- Proper Divisor Sum (Aliquot Sum)
- 413
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10696
- Möbius Function
- 1
- Radical
- 11107
- 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
- 130
- 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
- Molien series for alternating group Alt_8 (or A_8).at n=41A008631
- Number of step shifted (decimated) sequence structures using a maximum of four different symbols.at n=9A056393
- Numbers k such that sigma(k) divides sigma(phi(k)).at n=38A066831
- Numbers n such that sigma(phi(n))/sigma(n) = 2.at n=26A067382
- Maximum position in A072645 where the value n occurs.at n=5A072654
- Numbers m such that m and m+22 have the same sum of divisors.at n=36A172333
- A185243(n) is the a(n)-th triangular number.at n=43A185257
- Number of zero-sum -4..4 arrays of n elements with first and second differences also in -4..4.at n=6A201869
- T(n,k)=Number of zero-sum -k..k arrays of n elements with first and second differences also in -k..k.at n=51A201873
- Number of zero-sum -n..n arrays of 7 elements with first and second differences also in -n..n.at n=3A201878
- a(n) = (A216363(n) - 1)/118.at n=22A216380
- a(0) = 0, a(n) = previous term + repunit of length of previous term for n > 0.at n=37A247107
- Numbers n such that n!3 + 3 is prime, where n!3 = n!!! is a triple factorial number (A007661).at n=37A249400
- Number of (n+2)X(5+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010011.at n=5A260764
- Number of (n+2)X(6+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010011.at n=4A260765
- Least positive integer k such that both k and k*n belong to the set {m>0: 2*prime(prime(m))+1 = prime(p) for some prime p}.at n=4A261362
- Number of Dyck paths of semilength n such that all positive levels have the same number of peaks.at n=14A287987
- Number of permutations of [n] avoiding {2341, 2143, 4123}.at n=10A294719
- Numbers x = concat(a,b) such that b and a are the first two terms for a Fibonacci-like sequence containing x itself.at n=46A307863
- Irregular table whose rows are the nontrivial cycles of the ghost iteration A329200, ordered by increasing smallest member, always listed first.at n=3A329196