10385
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13056
- Proper Divisor Sum (Aliquot Sum)
- 2671
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7920
- Möbius Function
- -1
- Radical
- 10385
- 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
- 86
- 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
- a(n) = n*(2*n+5)*(n-1)/6.at n=31A051925
- (1/2)*(n^2+n+2)*(n^2+3*n+1).at n=11A058310
- Numbers k such that phi(k) + phi(k+3) = phi(k+1) + phi(k+2).at n=12A076665
- Expansion of (1 - x + 2*x^2) / (1 - x^3 + x^4).at n=53A110062
- G.f. A(x) = Sum_{n>=0} a(n)*x^n/2^(n*(n-1)/2) satisfies: A(x) = Sum_{n>=0} A(x)^n*x^n/2^(n*(n-1)/2).at n=5A118410
- Hankel transform of expansion of 1/c(x)^3, c(x) the g.f. of A000108.at n=29A144701
- Number of strings of numbers x(i=1..5) in 0..n with sum i*x(i)^2 equal to n*25.at n=37A184444
- Triangle read by rows: T(n,k) appears in the transformation Sum_{k=0..n} (k+1)*x^k = Sum_{k=0..n} T(n,k)*(x-2k)^k.at n=25A253382
- Numbers whose binary representation traces a non-selfcrossing circuit in the honeycomb lattice when each one of its bits, from the most significant to the least significant, is interpreted as a direction to proceed at each vertex.at n=37A255561
- Array read by antidiagonals: T(m,n) = number of minimal dominating sets in the rook graph K_m X K_n.at n=48A290632
- Array read by antidiagonals: T(m,n) = number of minimal dominating sets in the rook graph K_m X K_n.at n=51A290632
- Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 4 or 6 king-move adjacent elements, with upper left element zero.at n=10A304474
- Multiplicative order of 5 (mod A123692(n)^2).at n=1A305332
- Main diagonal of A332365.at n=17A332366
- The number of vertices on a 2 by 1 ellipse formed by the straight line segments mutually connecting all points formed by dividing the ellipse into 2n equal angle sectors from its origin.at n=11A341762
- Sum of number of divisors of x^y for each x >= 1, y >= 0, x + y = n.at n=38A343657