13132
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
- 2
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 27132
- Proper Divisor Sum (Aliquot Sum)
- 14000
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5544
- Möbius Function
- 0
- Radical
- 938
- Omega Function (Ω)
- 5
- 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
- 76
- 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
- Unsigned Stirling numbers of first kind s(n,3).at n=5A000399
- Sum of 12 nonzero 8th powers.at n=25A003390
- Numbers having four 4's in base 6.at n=29A043388
- McKay-Thompson series of class 10C for Monster.at n=53A058099
- Largest unsigned Stirling number of the first kind: max_k(s(n+1,k)); i.e., largest coefficient of polynomial x*(x+1)*(x+2)*(x+3)*...*(x+n).at n=7A065048
- Concatenation of n-th prime and n in decimal notation.at n=31A075110
- List of codewords in binary lexicode with Hamming distance 7 written as decimal numbers.at n=13A075937
- a(n) = n*(n+1)^2*(2+n)*(3+2*n)*(19+8*n)/180.at n=6A076758
- Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1 <= k <= n; in other words, the unsigned Stirling numbers of the first kind in reverse order).at n=33A094638
- Alfred Moessner's factorial triangle.at n=23A125714
- Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increasing powers of x. T(n,k) is also the unsigned Stirling number |s(n+1, k+1)|, denoting the number of permutations on n+1 elements that contain exactly k+1 cycles.at n=30A130534
- Expansion of (eta(q) * eta(q^2) / (eta(q^5) * eta(q^10)))^2 in powers of q.at n=53A132041
- Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.at n=39A132393
- Triangle related to the asymptotic expansion of E(x,m=4,n).at n=15A163934
- Triangle related to the o.g.f.s. of the right hand columns of A163934 (E(x,m=4,n)).at n=15A163939
- Partial sums of A165271.at n=30A165273
- Summed lengths of nonintersecting rook paths on a 4 X n board.at n=4A181395
- Summed lengths of nonintersecting rook paths on a 5 X n board.at n=3A181396
- Summed lengths of nonintersecting rook paths on an n X k board (square array by antidiagonals).at n=32A181399
- Summed lengths of nonintersecting rook paths on an n X k board (square array by antidiagonals).at n=31A181399