13563
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
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 21528
- Proper Divisor Sum (Aliquot Sum)
- 7965
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8160
- Möbius Function
- 0
- Radical
- 4521
- Omega Function (Ω)
- 4
- 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
- 89
- 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
- Nim product 2^n * 2^n.at n=13A006017
- Number of strict first-order maximal independent sets in path graph.at n=33A007383
- Divisors of 99999999.at n=25A027890
- Divisors of 10^16 - 1.at n=38A111211
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and having k UDUD's starting at level 0; here U=(1,1), D=(1,-1) (0<=k<=n-1).at n=46A127153
- Number of Dyck paths of semilength n and having no UDUD's starting at level 0; here U=(1,1), D=(1,-1).at n=10A127154
- a(n) = ceiling(exp(n)/n).at n=11A132407
- Number of permutations in S_n avoiding {bar 5}{bar 4}231 (i.e., every occurrence of 231 is contained in an occurrence of a 54231).at n=8A137553
- Long legs of primitive Pythagorean triples (a,b,c) for which 2a+1, 2b+1 and 2c+1 are primes.at n=35A165237
- Numbers with ordered partitions that have periods of length 5.at n=32A178572
- G.f.: (1+x)^(2*g)*(1+x^3)^(3*g)/((1-x^2)*(1-x^4))-x^(2*g)*(1+x)^4/((1-x^2)*(1-x^4)) for g=3.at n=16A199629
- a(n) = ( 2*n*(2*n^2 + 11*n + 26) - (-1)^n + 1 )/16.at n=36A256666
- Unique solution x of the congruence x^2 = -1 (mod m(n)), with m(n) = A002559(n) (Markoff numbers) in the interval [1, floor(m(n)/2)], assuming the Markoff uniqueness conjecture, for n >= 3.at n=26A324601
- Number of grid-filling curves of order n (on the square grid) with turns by +-90 degrees generated by folding morphisms that are self-avoiding but not plane-filling.at n=19A343990
- Consecutive states of the linear congruential pseudo-random number generator 20403*s mod 2^15 when started at s=1.at n=31A384196