13510
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 27936
- Proper Divisor Sum (Aliquot Sum)
- 14426
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- yes
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4608
- Möbius Function
- 1
- Radical
- 13510
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 37
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that 5*2^k - 1 is prime.at n=29A001770
- Weird numbers: abundant (A005101) but not pseudoperfect (A005835).at n=17A006037
- 12-gonal (or dodecagonal) pyramidal numbers: a(n) = n*(n+1)*(10*n-7)/6.at n=20A007587
- Numerators of continued fraction convergents to sqrt(117).at n=6A041212
- Unitary weird numbers: unitary abundant (A034683) but not unitary pseudoperfect (A293188).at n=14A064114
- Number of squares on infinite half chessboard at <=n knight moves from a fixed point on the edge.at n=44A098498
- G.f.: x*(1 - x + x^2)/((1-x)^2 * (1 - x - x^2)).at n=18A104161
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (1, 0, 1), (1, 1, -1), (1, 1, 0)}.at n=7A150852
- Triangle interpolating the swinging factorial (A056040) restricted to odd indices with its binomial inverse. Triangle read by rows. For n >= 0, k >= 0.at n=30A163772
- Left edge of the triangle in A033291.at n=34A192735
- Number of (n+1) X (n+1) -3..3 symmetric matrices with every 2 X 2 subblock having sum zero and three distinct values.at n=11A211323
- G.f. A(x) satisfies: 1 - x*A(x) + x^2*A(x)^2 = Sum_{n>=0} (-x)^(n^2).at n=10A217699
- Numbers n such that 2*Fibonacci(n+2)+((-1)^n-3)/2 is a prime.at n=33A271729
- Number of n X 2 0..1 arrays with exactly n+2-2 having value 1 and no three 1s forming an isosceles right triangle.at n=16A272952
- Bi-unitary weird numbers: bi-unitary abundant numbers (A292982) that are not bi-unitary pseudoperfect (A292985).at n=19A292986
- Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 4 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=7A300876
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 4 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=47A300881
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 4 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=52A300881
- Infinitary weird numbers: infinitary abundant numbers (A129656) that are not infinitary pseudoperfect numbers (A306983).at n=19A306984
- Number of parts in all twice partitions of n.at n=11A327594