11764
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 21924
- Proper Divisor Sum (Aliquot Sum)
- 10160
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5504
- Möbius Function
- 0
- Radical
- 5882
- 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
- yes
- 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
- Expansion of (1/theta_4 - 1)/2.at n=24A014968
- a(n) = binomial(n+2, 2) + binomial(n+4, 5).at n=15A027658
- Denominators of continued fraction convergents to sqrt(690).at n=8A042327
- a(n) = Sum_{k=1..n} antisigma(k), where antisigma(i) = sum of the nondivisors of i that are between 1 and i.at n=41A076664
- Multiples of 17 containing a 17 in their decimal representation.at n=22A121037
- 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, -1, 1), (-1, 0, 1), (0, 1, -1), (0, 1, 0), (1, 0, 0)}.at n=8A149967
- a(n) = p(n)*p(n+2) - 3*p(n+1), where p(n) is the n-th prime.at n=27A152528
- Augmentation of the triangular array A158405. See Comments.at n=26A193091
- Number of (n+2) X 5 binary arrays avoiding patterns 001 and 110 in rows, columns and nw-to-se diagonals.at n=10A202442
- Number A(n,k) of hybrid k-ary trees with n internal nodes; square array A(n,k), n>=0, k>=1, read by antidiagonals.at n=59A245049
- Number of hybrid 7-ary trees with n internal nodes.at n=4A245050
- Number of length 3+2 0..n arrays with the sum of the maximum minus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=8A252179
- Eulerian numbers of type D, the primary type.at n=24A262226
- Coordination sequence for (3,3,5) tiling of hyperbolic plane.at n=20A265072
- Number of Q graphs with 2*n vertices symmetrical about a distinguished edge.at n=13A294728
- a(n) is the least k such that A295520(k) = n.at n=39A295793
- Expansion of Product_{n>=1} 1/(1 + 4*x^n)^(1/2).at n=8A303352
- a(n) = 54*n^2 - 26*n + 4 (n>=1).at n=14A304381
- Lengths of largest face diagonal in primitive Euler bricks or Pythagorean cuboids: possible values of max(d, e, f) for solutions to a^2 + b^2 = d^2, a^2 + c^2 = e^2, b^2 + c^2 = f^2 in coprime positive integers a, b, c, d, e, f.at n=18A306120
- Numbers equal to the sum of the aliquot parts of the previous k numbers, for some k.at n=17A320021