12588
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
- 12
- Divisor Sum
- 29400
- Proper Divisor Sum (Aliquot Sum)
- 16812
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4192
- Möbius Function
- 0
- Radical
- 6294
- 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
- 125
- 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
- Numbers n such that 245*2^n-1 is prime.at n=14A050881
- Triangle, read by rows, such that the diagonal (A084785) is the self-convolution of the first column (A084784) and the row sums (A084786) gives the differences of the diagonal and the first column.at n=32A084783
- Sum over all partitions of n of the sum of the parts that are smaller than the largest part.at n=21A116688
- a(n) is the determinant of the 3 X 3 matrix with entries the 9 consecutive primes starting with the n-th prime.at n=40A117330
- Number of triangles that can be built from rods with lengths 1,2,...,n by using and concatenating not necessarily all rods.at n=12A160456
- Number of square involutions of n.at n=12A164990
- a(n) = floor(sqrt(2*n^5)).at n=38A172473
- The sums of pairs of adjacent terms are the odd palindromic primes in ascending order.at n=40A181882
- Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with x(i)+x(j), x(i+1)+x(j+1), -(x(i)+x(j+1)), and -(x(i+1)+x(j)) having two, three or four distinct values for every i<=n and j<=n.at n=4A211465
- Smallest sets of 6 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed.at n=27A228963
- a(n) = Sum_{i=0..n} digsum_6(i)^4, where digsum_6(i) = A053827(i).at n=22A231675
- Number of 2 X n binary arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two exactly once.at n=9A269012
- Least k > 1 such that phi(k*n-1) = phi(k*n+1), or -1 if no such k exists.at n=35A276052
- Least k such that phi(k*n-1) = phi(k*n+1), or -1 if no such k exists.at n=35A276373
- Number of maximal cliques in the n-triangular honeycomb queen graph.at n=35A289877
- The number of trees with 4 nodes labeled by positive integers, where each tree's label sum is n.at n=46A301739
- G.f.: Sum_{k>=0} q(k)^2 * x^k / Sum_{k>=0} q(k)*x^k, where q(n) is A000009(n).at n=33A304877
- Table read by rows: T(n,k) = number of k-sided polygons in a cross with width 3 and height n (see Comments in A331455 for definition) for k = 3,4,5.at n=51A330848
- Slice of elementary triangular automaton rule 58, starting from a lone 1 cell.at n=13A384363