11964
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 27944
- Proper Divisor Sum (Aliquot Sum)
- 15980
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3984
- Möbius Function
- 0
- Radical
- 5982
- Omega Function (Ω)
- 4
- 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
- no
- 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
- Number of irreducible positions of size n in Montreal solitaire.at n=10A007048
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 72.at n=35A031570
- For each prime p take the sum of nonprimes < p.at n=39A045717
- Interprimes which are of the form s*prime, s=12.at n=29A075287
- The initial decimal digits of 2^a(n) are the decimal digits of n followed by n.at n=32A171652
- G.f. satisfies: A(x) = x*A(x) + A(x^2*A(x)^2).at n=10A173139
- Number of nondecreasing sequences of n 1..7 integers with every element dividing the sequence sum.at n=28A212535
- Principal diagonal of the convolution array A213555.at n=7A213556
- Self-inverse permutation of natural numbers: a(0) = 0, a(1) = 1, and for n > 1, if A117966(n) < 0, a(n) = A117967(1+a(-(A117966(n)))), otherwise a(n) = A117968(a(A117966(n)-1)).at n=62A246211
- Number of length n+5 0..3 arrays with every six consecutive terms having two times the sum of some two elements equal to the sum of the remaining four.at n=6A249080
- Number of length 7+5 0..n arrays with every six consecutive terms having two times the sum of some two elements equal to the sum of the remaining four.at n=2A249092
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 211", based on the 5-celled von Neumann neighborhood.at n=25A270899
- Expansion of 1 / ((1-x)^2*(1-x^2)*(1-x^3)*...*(1-x^7)).at n=30A288342
- Number of nX4 0..1 arrays with each 1 horizontally or vertically adjacent to 0, 2 or 3 1s.at n=4A295348
- Number of nX5 0..1 arrays with each 1 horizontally or vertically adjacent to 0, 2 or 3 1s.at n=3A295349
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally or vertically adjacent to 0, 2 or 3 1s.at n=31A295352
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally or vertically adjacent to 0, 2 or 3 1s.at n=32A295352
- Irregular triangle read by rows: T(n, k) is the number of 2n-step closed walks on the square lattice having algebraic area k; n >= 0, 0 <= k <= floor(n^2/4).at n=23A352838