12560
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
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 29388
- Proper Divisor Sum (Aliquot Sum)
- 16828
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4992
- Möbius Function
- 0
- Radical
- 1570
- Omega Function (Ω)
- 6
- 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
- Number of unrooted triangulations of a hexagon with n internal nodes.at n=5A005502
- E.g.f. exp(sinh(x)^2) (even powers only).at n=4A009236
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 14.at n=15A031692
- Expansion of series related to Liouville's Last Theorem: g.f. sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^4 *product_{i=1..t} (1-x^i) ).at n=23A059821
- The number of distinct parts in the partition sequence lambda(n) formed by the recurrence lambda(1) = 1 and lambda(n+1) is the sum of lambda(n) and its conjugate.at n=28A064660
- Largest eigenvalue, rounded to the nearest integer, of a rank n matrix of 1..n^2 filled successively along antidiagonals (A069480).at n=27A072332
- a(n) = 4 * floor(23*2^n/15).at n=11A102651
- Row sums of correlation triangle for (1+x)^3/(1-x).at n=29A115293
- Matrix inverse of triangle A098568, where A098568(n, k) = C( (k+1)*(k+2)/2 + n-k-1, n-k) for n>=k>=0.at n=40A121434
- a(n) = 2*n*(4*n-3).at n=40A139271
- A Lucas-Binet triangle read by rows: t(n,m)=((( 1 + Sqrt[Prime[n]]))^m + (( 1 - Sqrt[Prime[n]]))^m)/2.at n=33A140895
- An even-powered type Binet p-adic triangular sequence: t(n,m)=((( 1 + sqrt(prime(n))))^(2*m) + (( 1 - sqrt(prime(n))))^(2*m))/2.at n=30A140896
- Number of permutations of 5 indistinguishable copies of 1..n arranged in a circle with exactly 2 adjacent element pairs in decreasing order.at n=3A151603
- 5 times heptagonal numbers: a(n) = 5*n*(5*n-3)/2.at n=32A153785
- Even indices of multidigit primes with digits in strictly increasing order.at n=31A155776
- a(n) = 64*n^2 + 16.at n=13A157912
- a(n) = 196*n^2 + 2*n.at n=7A158222
- a(n) = 256*n^2 + 16.at n=7A158574
- Number of binary strings of length n with no substrings equal to 0000 0001 or 0101.at n=13A164410
- Array T(n,k) read by antidiagonals: T(n,k) is the number of [n,k]-triangulations in the plane, n >= 0, k >= 0.at n=41A169808