16797
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 24480
- Proper Divisor Sum (Aliquot Sum)
- 7683
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10160
- Möbius Function
- -1
- Radical
- 16797
- Omega Function (Ω)
- 3
- 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
- 66
- 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
- no
- Odd
- yes
Appears in sequences
- Ordered sequence of distinct terms of the form floor(x^i * floor(x^j)), i,j >= 0, where x = sqrt(7).at n=33A022771
- Number of reversible strings with n-1 beads of 2 colors. 5 beads are black. String is not palindromic.at n=17A032092
- Dirichlet convolution of b_n=1 with Catalan numbers.at n=10A034731
- Recip transform of 2*(1 + x^2)-1/(1-x).at n=11A049150
- a(n) = C(n) + 1 - 0^n where C(n) = A000108(n).at n=10A141351
- Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 1110-0111 pattern in any orientation.at n=9A146476
- 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, 0), (-1, 1, 0), (0, 1, -1), (1, 0, -1), (1, 1, 1)}.at n=8A149661
- G.f.: 1 + Sum_{n>=1} x^n * exp( Sum_{k>=1} binomial(2*n*k-1, n*k) * x^(n*k)/k ).at n=11A206777
- Number of Young tableaux with n 10-length rows, increasing entries down the columns and monotonic entries along the rows (first row increasing).at n=2A208630
- Number of Dyck n-paths with equally spaced returns.at n=11A216435
- Number of n-element subsets of [n+5] having an even sum.at n=18A282081
- Number of excursions of length n with Motzkin-steps avoiding the consecutive steps UH, HU, HD and DH.at n=20A329696