11966
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18624
- Proper Divisor Sum (Aliquot Sum)
- 6658
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5760
- Möbius Function
- -1
- Radical
- 11966
- 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
- 50
- 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
- Sum of first prime(n) primes.at n=20A022094
- a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, s(1) = 1, s(n) = 4, |s(i) - s(i-1)| <= 1 for i >=2, |s(2) - s(1)| = 1, |s(3) - s(2)| = 1 if s(2) = 1. Also a(n) = T(n,n-4), where T is the array in A026268.at n=8A026290
- Number of partitions of n^2 into distinct squares.at n=41A030273
- Numbers whose base-4 representation contains exactly four 2's and three 3's.at n=12A045156
- Number of positive integers <= 2^n of form 5 x^2 + 7 y^2.at n=17A054177
- a(n) = A000203(n)^2 - A001157(n) = sigma(n)^2 - sigma_2(n).at n=47A066293
- a(0) = 0, a(1) = 1 and for n >= 2, a(n) = floor(2 * sqrt(a(n-2) * a(n-1))).at n=23A093333
- Sum of the first 2n+1 primes.at n=36A109723
- a(n) = n-th prime * n-th nonprime.at n=43A127118
- A051838 gives numbers m such that the sum of first m primes divides the product of the first m primes. This sequence gives corresponding values of the sum of first m primes.at n=18A140763
- Numbers with ordered partitions that have periods of length 5.at n=30A178572
- G.f.: A(x) = Sum_{n>=0} Product_{k=1..n} ((1+x)^k - 1).at n=7A179525
- a(n) = Sum_{k=1..n} (k+2)!/k! = Sum_{k=1..n} (k+2)*(k+1).at n=31A180118
- Triangular array: T(n,k) counts upper triangular matrices with entries from {0,1} having n 1's in total, with k 1's on the main diagonal and at least one nonzero entry in each row.at n=28A182319
- Number of nondecreasing -n..n vectors of length 3 whose dot product with some nondecreasing -n..n vector equals 3.at n=20A226411
- Numbers in A007504 such that omega(a(n)) = Omega(a(n)) = 3.at n=14A264885
- Numbers k such that (11*10^k - 107) / 3 is prime.at n=22A278591
- Expansion of the series reversion of -1 + Product_{k>=1} 1/(1 - x^k)^k.at n=6A291488
- Sum of the largest parts of the partitions of n into 5 parts.at n=36A308827
- G.f. satisfies A(x) = A(x^2)*A(x^3) / (1-x).at n=38A382126