13532
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 25200
- Proper Divisor Sum (Aliquot Sum)
- 11668
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6336
- Möbius Function
- 0
- Radical
- 6766
- 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
- 138
- 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
- yes
- Odd
- no
Appears in sequences
- Number of rooted trees with n nodes, 2 of which are labeled.at n=7A000524
- a(n) = a(n-1)*a(n-2) - a(n-3), with a(1) = 0, a(2) = 1, a(3) = 2.at n=9A022405
- Number of self-avoiding closed walks (from (0,0) to (0,0)) of length 2n in strip {-1, 0, 1} X Z.at n=11A022444
- Number of nonempty subsets of {1,2,...,n} in which exactly 3/4 of the elements are <= (n+1)/3.at n=25A048042
- Number of nonempty subsets of {1,2,...,n} in which exactly 3/4 of the elements are <= (n+2)/3.at n=25A048075
- Number of nonempty subsets of {1,2,...,n} in which exactly 3/4 of the elements are <= (n+3)/3.at n=25A048086
- Numbers k such that z(k) = j(k), where z(k) = sopf(k - d(k)), j(k) = d(sopf(k) + k), sopf(k) = A008472(k) and d(k) = A000005(k).at n=20A063961
- Least k such that k*10^n-9, k*10^n-7, k*10^n-3 and k*10^n-1 are all prime.at n=10A064432
- Duplicate of A064432.at n=10A064972
- Numbers k such that k*10^10-1, k*10^10-3, k*10^10-7 and k*10^10-9 are all prime.at n=0A064981
- Number of compositions of n with exactly 2 adjacent equal parts (2 pairs or 1 triple.).at n=14A106358
- Number of essentially different semi-magic squares of order 3 with semimagic sum n.at n=28A122751
- 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, -1, 0), (-1, -1, 1), (-1, 1, 0), (0, 0, -1), (1, 0, 0)}.at n=11A148056
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0) and consisting of n steps taken from {(-1, 1), (0, 1), (1, -1), (1, 0)}.at n=8A151284
- The number of bidirectional ballot sequences of length n, i.e., the number of 0-1 sequences of length n such that every prefix and every suffix has more 1's than 0's.at n=19A167510
- a(n) = (n*3^(n+1)+((5*3^(n+1)+(-1)^(n))/4))/4.at n=7A191008
- Number of (n+1)X(n+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally or vertically, with no adjacent elements equal.at n=4A232399
- Number of (n+1)X(5+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally or vertically, with no adjacent elements equal.at n=4A232403
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally or vertically, with no adjacent elements equal.at n=40A232406
- Number of partitions p of n such that median(p) > multiplicity(min(p)).at n=40A240215