11686
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17532
- Proper Divisor Sum (Aliquot Sum)
- 5846
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5842
- Möbius Function
- 1
- Radical
- 11686
- 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
- 81
- Smith Number
- yes
- 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
- yes
- Odd
- no
Appears in sequences
- Related to representation as sums of squares.at n=26A002292
- Number of trees with stability index n.at n=11A003429
- a(1)=1, a(n) = 22*a(n-1) + n.at n=3A014907
- Expansion of 1/((1-2x)(1-7x)(1-11x)(1-12x)).at n=3A028014
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 74 ones.at n=9A031842
- Expansion of (1+4*x)/(1-6*x+x^2).at n=5A054489
- Final members of groups in A076105.at n=28A076102
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (0, 0, 1), (0, 1, -1), (1, 0, -1)}.at n=9A148701
- Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = 2*k if k <= floor(n/2) otherwise 2*(n-k), and m = 3, read by rows.at n=17A157278
- Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = 2*k if k <= floor(n/2) otherwise 2*(n-k), and m = 3, read by rows.at n=18A157278
- The sums of pairs of adjacent terms are the odd palindromic primes in ascending order.at n=34A181883
- Number of lower triangles of an (n+6)X(n+6) 0..4 array with new values introduced in row major order 0..4 and no element unequal to more than one horizontal or vertical neighbor.at n=4A194774
- T(n,k)=Number of lower triangles of an (n+2k-2)X(n+2k-2) 0..k array with new values introduced in row major order 0..k and no element unequal to more than one horizontal or vertical neighbor.at n=32A194778
- Number of lower triangles of a (2n+3)X(2n+3) 0..n array with new values introduced in row major order 0..n and no element unequal to more than one horizontal or vertical neighbor.at n=3A194783
- Expansion of q^(-1/2) * k(q) * (1 - k(q)^4) * (K(q) / (Pi/2))^6 / 4 in powers of q where k(), k'(), K() are Jacobi elliptic functions.at n=26A225923
- Sum of median parts of all partitions of n into an odd number of distinct parts.at n=48A268359
- Values of n such that n^2 + 5 is a triangular number (A000217).at n=10A276599
- Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 5 or 6 king-move adjacent elements, with upper left element zero.at n=10A304599