11690
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 24192
- Proper Divisor Sum (Aliquot Sum)
- 12502
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- yes
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3984
- Möbius Function
- 1
- Radical
- 11690
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 99
- 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
- Weird numbers: abundant (A005101) but not pseudoperfect (A005835).at n=12A006037
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = natural numbers, t = odd natural numbers.at n=39A024862
- a(n) = T(2n-1,n-2), T given by A026648.at n=6A026653
- Expansion of 1/((1-5x)(1-8x)(1-9x)(1-11x)).at n=3A028191
- a(n) = Sum_{k=1..floor(n/2)} T(n, 2k), array T as in A049777.at n=39A049779
- Unitary weird numbers: unitary abundant (A034683) but not unitary pseudoperfect (A293188).at n=8A064114
- Zero, together with positive numbers k such that prime(k) + k is a square.at n=41A064371
- Triangle of coefficients of characteristic polynomials of anti-symmetrical tridiagonal matrices: Middle diagonal: a=1; Lower first subdiagonal: b=2; Upper first subdiagonal: c=-2; Example: M(3) {{1, -2, 0}, {2, 1, -2}, {0, 2, 1}}.at n=59A136643
- Consider the 2^n values of A139250(i)/i^2 for 2^n <= i < 2^(n+1); a(n) = value of i where this quantity is minimized.at n=13A170927
- Number of binary words of length n containing no subword 10001.at n=14A210003
- Number of 5 X n 0..1 arrays with antidiagonals unimodal and rows and diagonals nondecreasing.at n=13A224041
- Numbers obtained by concatenating the squares of the digits of Catalan(n).at n=8A244746
- Number of primitive (period n) n-bead necklace structures using an infinite alphabet.at n=9A276547
- Number of heptagons that can be formed with perimeter n.at n=47A288253
- Bi-unitary weird numbers: bi-unitary abundant numbers (A292982) that are not bi-unitary pseudoperfect (A292985).at n=13A292986
- Number of nX7 0..1 arrays with every element unequal to 1, 2, 5 or 8 king-move adjacent elements, with upper left element zero.at n=7A304301
- Infinitary weird numbers: infinitary abundant numbers (A129656) that are not infinitary pseudoperfect numbers (A306983).at n=13A306984
- a(n) = ((n + 1) - 9*(n + 1)^2 + 8*(n + 1)^3)/6.at n=20A331987
- Nonexponential weird numbers: nonexponential abundant numbers (A348604) that are not equal to the sum of any subset of their nonexponential divisors.at n=7A348631
- (1+e)-weird numbers: (1+e)-abundant numbers k such that no subset of the aliquot (1+e)-divisors of k sums to k.at n=8A349285