13172
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
- 23940
- Proper Divisor Sum (Aliquot Sum)
- 10768
- 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
- 6586
- 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
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...), t = (composite numbers).at n=33A024480
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (1, p(1), p(2), ...), t = (composite numbers).at n=32A025100
- Least k such that first k terms of A022300 contain n more 2's than 1's.at n=23A025515
- Divide even numbers into groups with prime(n) elements and add together.at n=11A034959
- Numbers n such that n | sigma_12(n).at n=21A055716
- Rounded total surface area of a regular icosahedron with edge length n.at n=39A071398
- Least m such that Sigma-Composite-Harmonic series Sum_{k=1..m} 1/A000203(A002808(k)) >= n.at n=3A074469
- Even numbers n such that 37^2 (the square of the first irregular prime) divides the numerator of Bernoulli(n).at n=23A090789
- Number of partitions of n such that the number of different parts is odd.at n=37A090794
- Triangle read by rows: T(n,k) is the number of permutations p of {1,2,...,n} such that the set {p(i)-i, i=1,2,...,n} has exactly k elements (1<=k<=n).at n=48A125182
- G.f.: 1/p(x), where p(x) = degree 22 Salem polynomial p(x) = x^22 + x^21 - x^19 - 2*x^18 - 3*x^17 - 3*x^16 - 2*x^15 + 2*x^13 + 4*x^12 + 5*x^11 + 4*x^10 + 2*x^9 - 2*x^7 - 3*x^6 - 3*x^5 - 2*x^4 - x^3 + x + 1.at n=35A143419
- Number of -1..1 arrays x(0..n+1) of n+2 elements with zero sum and no two neighbors summing to zero.at n=14A199825
- Number of sets of exactly five positive integers <= n having a square element sum.at n=28A281865
- Number of multisets of exactly six partitions of positive integers into distinct parts with total sum of parts equal to n.at n=18A320791
- Total sum of parts which are powers of 2 in all partitions of n.at n=23A342231