12590
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22680
- Proper Divisor Sum (Aliquot Sum)
- 10090
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5032
- Möbius Function
- -1
- Radical
- 12590
- Omega Function (Ω)
- 3
- 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
- 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
- yes
- Odd
- no
Appears in sequences
- Conjectured dimensions of spaces of weight systems of chord diagrams.at n=18A014595
- Numbers that contain as proper substrings every maximal prime power dividing them.at n=6A059401
- Numbers k such that 3*10^k + 6*R_k - 5 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=17A102974
- Numbers k such that 22 * 10^k + 1 is prime.at n=10A109397
- Smallest number whose tenth power has at least n digits.at n=41A130084
- Number of walks within N^2 (the first quadrant of Z^2) starting and ending at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 0), (-1, 1), (0, 1), (1, 0)}.at n=11A151354
- Indices of pentagonal pyramidal numbers which are the sum of two other such numbers: k such that A002411(k) = A002411(i)+A002411(j) for some i,j>0.at n=26A172437
- Number of three-choice polygons by area.at n=8A173412
- Number of 3-step one space for components leftwards or up, two space for components rightwards or down asymmetric quasi-queen's tours (antidiagonal moves become knight moves) on an n X n board summed over all starting positions.at n=15A187858
- Number of (n+1)X(1+1) 0..3 arrays with the maximum plus the upper median plus the lower median minus the minimum of every 2X2 subblock equal.at n=3A237083
- Number of (n+1)X(4+1) 0..3 arrays with the maximum plus the upper median plus the lower median minus the minimum of every 2X2 subblock equal.at n=0A237086
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the upper median plus the lower median minus the minimum of every 2X2 subblock equal.at n=6A237090
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the upper median plus the lower median minus the minimum of every 2X2 subblock equal.at n=9A237090
- Number of partitions of n such that the number of parts having multiplicity 1 is not a part and the number of distinct parts is a part.at n=44A241443
- Square spiral in which each new term is the sum of its two largest neighbors.at n=47A278180
- a(n) = Sum_{k=0..floor(n/4)} (-1)^k * binomial(n-1-3*k,k) * binomial(2*n-8*k,n-4*k).at n=8A360295
- Lesser of 2 successive sphenic numbers (k, k+4) sandwiching 3 consecutive nonsquarefree numbers.at n=20A363830