10387
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12096
- Proper Divisor Sum (Aliquot Sum)
- 1709
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8832
- Möbius Function
- -1
- Radical
- 10387
- 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
- Molien series for A_6.at n=49A008629
- Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k peaks at odd height.at n=49A101894
- Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k peaks at even height.at n=50A101895
- Index of first occurrence of n-th prime in A001203, the continued fraction for Pi.at n=31A107892
- Positive integers that are the difference between two double factorials.at n=50A111300
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k columns ending at an odd level (0<=k<=n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=39A121697
- Numbers which are the sum of 3 cubes of distinct odd primes.at n=29A138853
- a(1)=0, a(n) = n^3 - a(n-1).at n=26A153026
- a(n) = 36*n^2 - n.at n=16A157286
- a(n) = 289*n^2 - 17.at n=5A158587
- Composite numbers n such that 8*n^2-2*n-1 divides the primitive part U(n) of Fibonacci(n).at n=24A159234
- Ordered differences of double factorials.at n=48A204912
- Number of (2+1) X (n+1) 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=8A231264
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + n - 1, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4.at n=15A294367
- a(n) is the number of regions formed by n-secting the angles of a nonagon (enneagon).at n=24A335781
- a(n) = Sum_{d|n} phi(d) * binomial(d+n/d-1, d).at n=48A338655
- G.f. A(x) satisfies A(x) = 1/( (1 - x*A(x)^3) * (1 - x*A(x)) )^2.at n=4A379283
- Number of integer compositions of n that are the first sums of more than one composition.at n=32A391628