5798
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9408
- Proper Divisor Sum (Aliquot Sum)
- 3610
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2664
- Möbius Function
- -1
- Radical
- 5798
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- yes
- 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
- 142
- 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
- Motzkin numbers: number of ways of drawing any number of nonintersecting chords joining n (labeled) points on a circle.at n=11A001006
- Expansion of 1/((1-2x)(1+x^2)(1-x-2x^3)).at n=11A003477
- Coordination sequence T8 for Zeolite Code EUO.at n=47A008103
- If a, b in sequence, so is ab+10.at n=28A009368
- Sum along upward diagonal of Pascal triangle to center.at n=19A010752
- Sum along upward diagonal of Pascal triangle up to (but not including) center.at n=19A010753
- A Motzkin triangle: a(n,k), n >= 2, 2 <= k <= n, = number of complete, strictly subdiagonal staircase functions.at n=77A020474
- a(n) = L(n+2) + c(n) where L(k) is the k-th Lucas number and c(n) is the n-th number that is 1 or 3 or is not a Lucas number.at n=15A022810
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th number that is 1 or 2 or is not a Fibonacci number).at n=15A023498
- a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A026670.at n=12A026678
- a(n) = Sum_{j=0..n} T(n,j), T given by A026736.at n=12A026743
- a(n) = T(n,m) + T(n,m+1) + ... + T(n,n), where m=[ (n+1)/2 ], T given by A026725.at n=13A026847
- Path-counting array T(i,j) obtained from array t in A038792 by T(i,j)=t(2i+1,j).at n=51A038738
- a(n) = T(n,n-3), array T as in A038738.at n=6A038740
- T(n,n-6), array T as in A038792.at n=13A038796
- Base-7 palindromes that start with 2.at n=36A043016
- Numbers whose base-7 representation contains exactly four 2's.at n=21A043404
- Numbers whose base-4 representation contains exactly three 1's and four 2's.at n=3A045104
- Partial sums of rows of A047884. Young Tableaux by height.at n=57A049400
- T(n,n-3), array T as in A054110.at n=23A054112