16796
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 35280
- Proper Divisor Sum (Aliquot Sum)
- 18484
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 6912
- Möbius Function
- 0
- Radical
- 8398
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
Special
- Factorial
- no
- Catalan Number
- yes
- 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
- 66
- 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
- Symmetrical dissections of an n-gon.at n=18A000063
- Symmetrical dissections of an n-gon.at n=17A000063
- Expansion of (sqrt(1-4x^2) - sqrt(1-4x))/(2x).at n=10A000912
- Expansion of (1-4*x)^(3/2) in powers of x.at n=12A002421
- a(n) = floor( binomial(n,9)/10 ).at n=20A011846
- Incorrect version of A035010.at n=8A019275
- Expansion of (1-4*x)^(19/2).at n=12A020931
- a(n) = T(n, floor(n/2)), where T = Catalan triangle (A008315).at n=18A026008
- a(n) = floor( binomial(n, floor(n/2))/(1 + ceiling(n/2)) ) (interpolates between Catalan numbers).at n=20A028303
- a(n) = ceiling( binomial(n, floor(n/2))/(1 + ceiling(n/2)) ) (interpolates between Catalan numbers).at n=20A028304
- Triangle T(n,m) = Sum_{k=0..m} Catalan(n-k)*Catalan(k).at n=54A028364
- Concatenate rows of triangle in A028364 (removing duplicates).at n=46A028378
- Catalan's triangle with right border removed (n > 0, 0 <= k < n).at n=54A030237
- Number of aperiodic necklaces of n beads of 2 colors, 10 of them black.at n=10A032168
- Number of aperiodic necklaces of n beads of 2 colors, 11 of them black.at n=9A032169
- Number of necklaces with 10 black beads and n-10 white beads.at n=11A032195
- Number of necklaces with 11 black beads and n-11 white beads.at n=10A032196
- Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.at n=54A033282
- Number of prime binary rooted trees with n external nodes.at n=9A035010
- Triangle read by rows giving number of ways to glue sides of a 2n-gon so as to produce a surface of genus g.at n=30A035309