10395
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 23040
- Proper Divisor Sum (Aliquot Sum)
- 12645
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4320
- Möbius Function
- 0
- Radical
- 1155
- Omega Function (Ω)
- 6
- 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
- 86
- 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
- no
- Odd
- yes
Appears in sequences
- Double factorial of odd numbers: a(n) = (2*n-1)!! = 1*3*5*...*(2*n-1).at n=6A001147
- Triangle of coefficients of Bessel polynomials (exponents in decreasing order).at n=21A001497
- Triangle of coefficients of Bessel polynomials (exponents in decreasing order).at n=22A001497
- Triangle a(n,k) (n >= 0, 0 <= k <= n) of coefficients of Bessel polynomials y_n(x) (exponents in increasing order).at n=26A001498
- Triangle a(n,k) (n >= 0, 0 <= k <= n) of coefficients of Bessel polynomials y_n(x) (exponents in increasing order).at n=27A001498
- Number of partitions of floor(5n/2) into n nonnegative integers each no more than 5.at n=35A001975
- Degrees of irreducible representations of Mathieu group M_24.at n=25A003859
- Degrees of irreducible representations of McLaughlin group McL.at n=23A003909
- Degrees of irreducible representations of McLaughlin group McL.at n=22A003909
- Degrees of irreducible representations of Conway group Co2.at n=11A003911
- Degrees of irreducible representations of Conway group Co2.at n=12A003911
- Odd abundant numbers (odd numbers m whose sum of divisors exceeds 2m).at n=23A005231
- a(n) = n*(n+1)*(n+2)*(n+7)/24.at n=20A005582
- Double factorials n!!: a(n) = n*a(n-2) for n > 1, a(0) = a(1) = 1.at n=11A006882
- Smallest k such that k*n is a double factorial.at n=12A007919
- Triangle T(n,k) of associated Stirling numbers of second kind, n >= 2, 1 <= k <= floor(n/2).at n=35A008299
- Triangle T(n,k) read by rows: associated Stirling numbers of first kind (n >= 2, 1 <= k <= floor(n/2)).at n=35A008306
- Degrees of irreducible representations of group U6(2).at n=30A008948
- Degrees of irreducible representations of group U6(2).at n=29A008948
- Degrees of irreducible representations of group U6(2).at n=28A008948