10813
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11808
- Proper Divisor Sum (Aliquot Sum)
- 995
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9820
- Möbius Function
- 1
- Radical
- 10813
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 161
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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) = C(n,5) + C(n,4) - C(n,3) + 1, n >= 7.at n=12A005288
- Column of Motzkin triangle.at n=9A005322
- Number of squares on infinite chessboard at <= n knight's moves from a fixed square.at n=28A018836
- a(n) = (d(n) - r(n))/5, where d = A026037 and r is the periodic sequence with fundamental period (1,2,0,2,0).at n=52A026039
- Greatest number in row of n array T given by A026300.at n=11A026938
- Expansion of (1-2x^2)/(1-x-3x^2+2x^4).at n=13A052962
- a(1)=1. a(n) = a(n-1) + sum of the squares which are among the first (n-1) terms of the sequence.at n=40A101135
- Triangle read by rows: T(n,k) is the number of short bushes with n edges and having the leftmost leaf at height k (a short bush is an ordered tree with no nodes of outdegree 1).at n=51A106489
- Triangle read by rows: T(n,k) is number of Grand Motzkin paths of length n having k returns to the x-axis from above (i.e., d steps hitting the x-axis).at n=37A109195
- a(n) = (n+1)(n+2)(n+3)(9n^2 + 26n + 20)/120.at n=9A110159
- Number of lines through at least 2 points of a 5 X n grid of points.at n=44A160845
- Number of reduced words of length n in the Weyl group A_15.at n=5A161476
- a(n) = T(10,n), array T given by A048505.at n=6A195856
- Integers k such that (k^2 + (k+1)^2) has no square proper substring.at n=59A238903
- Integers k such that the concatenation of 2^k and 3^k is prime.at n=19A268111
- a(n) = (1 + Sum_{j=1..K-1} a(n-j) + a(n-1)*a(n-K+1))/a(n-K) with a(1),...,a(K)=1, where K=4.at n=10A283329
- Irregular triangle read by rows: T(n,m) = number of lattice paths of type A^Q terminating at point (n, m).at n=32A291083
- The number of distinct positions on an infinite chessboard reachable by the (3,4)-leaper in <= n moves.at n=14A297741
- Floor of area of triangle whose sides are consecutive Ulam numbers (A002858).at n=33A330909
- a(n) = 3*binomial(n,4) - 6*binomial(n,3) + 4*binomial(n,2) - 2.at n=21A335694