13632
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
- 28
- Divisor Sum
- 36576
- Proper Divisor Sum (Aliquot Sum)
- 22944
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4480
- Möbius Function
- 0
- Radical
- 426
- Omega Function (Ω)
- 8
- 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
- 19
- 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
- Series for second perpendicular moment of hexagonal lattice.at n=8A006742
- Numbers k such that k divides the (right) concatenation of all numbers <= k written in base 25 (most significant digit on right).at n=20A029518
- Number of partitions of n with nonnegative crank.at n=38A064428
- a(n) = (5*4^n + (-2)^n)/6.at n=7A083424
- Numbers n such that phi(sigma(n)) + phi(phi(n)) = n.at n=6A107651
- Numbers n such that p(10n) is prime, where p(n) is the number of partitions of n.at n=21A114170
- 1/12 of the number of permutations of 3 indistinguishable copies of 1..n with exactly 2 local maxima.at n=4A152499
- Indices of primes of the form 2^t*3^u + 1 in the primes.at n=33A174099
- Products of the 6th power of a prime and 2 distinct primes (p^6*q*r).at n=38A179672
- a(n) = Pell(n)*A000143(n) for n>=1 with a(0)=1, where A000143(n) is the number of ways of writing n as a sum of 8 squares.at n=4A209444
- T(n,k) = total area of all squares and rectangles of area 2^(k-1) after 2^n stages in the toothpick structure of A139250, n>=1, k>=1, assuming the toothpicks have length 2. Triangle read by rows.at n=40A211017
- Number of partitions of n for which (number of occurrences of the least part) > (number of occurrences of greatest part).at n=35A236544
- Numbers appearing in A245180.at n=34A245181
- Number of tilings of a 5 X n rectangle using n pentominoes of distinct shapes.at n=8A246902
- Expansion of phi(q) * phi(-q^3) * f(-q^12) / f(-q^4)^3 in powers of q where phi(), f() are Ramanujan theta functions.at n=45A254372
- Number of (n+2)X(3+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001111.at n=6A260365
- Number of (n+2)X(7+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001111.at n=2A260369
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001111.at n=38A260370
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001111.at n=42A260370
- Expansion of Product_{k>=1} (1 - x^(8*k))/(1 - x^k).at n=36A261775