13524
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 38304
- Proper Divisor Sum (Aliquot Sum)
- 24780
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3696
- Möbius Function
- 0
- Radical
- 966
- Omega Function (Ω)
- 6
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 45
- 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
- Positive numbers k such that k and 2*k are anagrams in base 6 (written in base 6).at n=11A023064
- a(n) = 49*(n-1)*(n-2)/2.at n=22A027469
- Number of reversible strings with n-1 beads of 2 colors. 6 beads are black. Strings are not palindromic.at n=12A032093
- Numbers n such that { x +- 2^k : 0 < k < 4 } are primes, where x = 210*n - 105.at n=8A061671
- a(0)=1, a(n) = 2*Fibonacci(n+4) - 6.at n=16A063758
- Triangle read by rows: S_B(n,k) = "Type B" Stirling numbers of the second kind.at n=30A085483
- a(n) = (n+1)(n+2)^2*(n+3)^2*(n+4)^2*(n+5)(3n^2 + 13n + 15)/43200.at n=4A107941
- a(n) = (p(n)*p(n+1)-p(n+2))/2, where p(n) is the n-th odd prime.at n=36A152527
- a(n) = n^3 - n*(n+1)/2.at n=24A160378
- Expansion of (1+147*x+1098*x^2+1638*x^3+632*x^4+59*x^5+x^6)/(1-x)^7.at n=3A160854
- a(n) = binomial(n+1,2)*7^2.at n=23A162942
- a(n) is the number of n-tosses having a run of 3 or more heads and a run of 3 or more tails for a fair coin.at n=14A167826
- Expansion of g.f.: x^3*(1 + 4*x - x^2 - 6*x^3 + x^4)/(1 - 9*x^2 - 3*x^3 + 17*x^4 + 8*x^5 - 6*x^6 - 7*x^7 + x^8 - x^9).at n=12A173652
- Permutations of 12345: Numbers having each of the decimal digits 1,...,5 exactly once, and no other digit.at n=10A178475
- Number of 4-step S, E, and NW-moving king's tours on an n X n board summed over all starting positions.at n=26A187509
- Triangle read by rows: T(n,k) (n >= 0, 1 <= k <= n+1) are the signed Hultman numbers.at n=41A189507
- Agreement numbers: number of n X 2 arrays of the count of horizontal and vertical neighbors equal to the corresponding element in a random 0..3 n X 2 array.at n=5A220783
- T(n,k)=Agreement numbers: number of nXk arrays of the count of horizontal and vertical neighbors equal to the corresponding element in a random 0..3 nXk array.at n=26A220786
- T(n,k)=Agreement numbers: number of nXk arrays of the count of horizontal and vertical neighbors equal to the corresponding element in a random 0..3 nXk array.at n=22A220786
- T(n,k)=Agreement numbers: number of nXk arrays of the count of horizontal and vertical neighbors equal to the corresponding element in a random 0..2 nXk array.at n=22A220800