6188
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 14112
- Proper Divisor Sum (Aliquot Sum)
- 7924
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2304
- Möbius Function
- 0
- Radical
- 3094
- Omega Function (Ω)
- 5
- 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
- 36
- Smith Number
- yes
- 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
- Binomial coefficients C(n,5).at n=17A000389
- Binomial coefficients C(2*n+5,5).at n=6A002299
- Number of permutations of [n+1] with exactly 1 increasing subsequence of length 3.at n=6A003517
- Expansion of (1-x^13) / (1-x)^13.at n=5A008495
- 11-dimensional centered tetrahedral numbers.at n=5A008505
- Expansion of sin(log(1+x)/cosh(x)).at n=8A009466
- Binomial coefficient C(17,n).at n=5A010933
- Binomial coefficient C(17,n).at n=12A010933
- a(n) = binomial(n,12).at n=5A010965
- Triangular array formed from even elements to right of middle of rows of Pascal's triangle.at n=34A014476
- Number of 4-ary search trees on n keys.at n=12A019498
- Binomial coefficients: C(n,k), 5 <= k <= n-5, sorted.at n=21A024749
- Binomial coefficients: C(n,k), 5 <= k <= n-5, sorted.at n=22A024749
- Binomial coefficients: C(n,k), 4 <= k <= n-4, sorted, duplicates removed.at n=25A024756
- Binomial coefficients: C(n,k), 5 <= k <= n-5, sorted, duplicates removed.at n=11A024757
- a(n) = binomial(3n-1, n-1).at n=6A025174
- a(n) = binomial(2n+1,n-3).at n=5A030053
- Take n equally spaced points on circle, connect them by a path with n-1 line segments; sequence gives number of distinct path lengths.at n=12A030077
- Catalan's triangle with right border removed (n > 0, 0 <= k < n).at n=61A030237
- a(n) = (3*n - 1)*(4*n - 1).at n=23A033578