12597
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 20160
- Proper Divisor Sum (Aliquot Sum)
- 7563
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6912
- Möbius Function
- 1
- Radical
- 12597
- Omega Function (Ω)
- 4
- 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
- 63
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- 4-dimensional pyramidal numbers: a(n) = (3*n+1)*binomial(n+2, 3)/4. Also Stirling2(n+2, n).at n=17A001296
- Number of walks of length 2n+8 in the path graph P_9 from one end to the other.at n=5A005024
- a(n) = dot_product(1,2,...,n)*(3,4,...,n,1,2).at n=31A026037
- a(n) = C(n+2, 2) + C(n+2, 3) + C(n+2, 4) + C(n+2, 5).at n=16A027660
- a(1) = 1; a(n+1) = sum of terms in continued fraction for the sum of the continued fractions, [a(1); a(2), a(3),...,a(n-1),a(n)] and [a(n); a(n-1), a(n-2),...,a(2), a(1)].at n=15A058081
- Numbers n such that sigma(n+1)-sigma(n) = -sigma(n)/d(n), where d(n) denotes the number of divisors of n.at n=4A066177
- Numbers k that divide 2^(k+3) - 1.at n=43A069927
- Numbers k such that prime(k) + prime(k+1) + prime(k+2) is a square.at n=20A076305
- Sequence resulting from a sum of three repeated binomial(n+3,4) sequences.at n=32A093039
- Triangle read by rows: for 1 <= k < n, a(n, k) is the least number not already used. For n > 1, a(n, n) is the least number not already used such that the product of the n-th row is a multiple of the product of the previous row.at n=27A094275
- Leading diagonal of triangle A094275.at n=6A094276
- Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 1, s(2n) = 5.at n=7A094828
- Expansion of x^3/((1-3*x+x^2)*(1-5*x+5*x^2)).at n=9A094865
- Number of compositions of n in which the smallest part is equal to the number of parts.at n=45A098133
- Structured snub cubic numbers.at n=12A100150
- Numbers k such that the central binomial coefficient C(2k,k) is divisible by k^2.at n=24A121943
- Numbers k which divide the sum of the Fibonacci numbers F(1) through F(k) and such that k is not a multiple of 24.at n=14A124456
- Binomial transform of the "1,2,3,..." triangle.at n=61A125027
- Column 3 of triangle in A133721.at n=51A133722
- a(n) = floor((x^n - (1-x)^n)/sqrt(2)+ 1/2) where x = (sqrt(2)+1)/2.at n=51A136421