12516
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 33600
- Proper Divisor Sum (Aliquot Sum)
- 21084
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3552
- Möbius Function
- 0
- Radical
- 6258
- Omega Function (Ω)
- 5
- 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
- 112
- 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
- Powers of rooted tree enumerator.at n=11A000529
- Number of partitions into one kind of 1's, two kinds of 2's, and three kinds of 3's.at n=37A002597
- Number of partitions of n into parts not of the form 25k, 25k+11 or 25k-11. Also number of partitions with at most 10 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=34A036010
- A class of Boolean functions of n variables and rank 3.at n=10A051361
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,5.at n=23A064239
- Triangle T(n,m) read by rows: matrix product A053121 * A038207.at n=60A096164
- A triangular sequence of coefficients from a three level exponential expansion function: f(x,t) = log(1 + t)*(1 - t)*exp(x*(t - t^2)).at n=43A137455
- Number L([n],m) of ways the labeled parts of each integer partition of n can be distributed into m nonempty labeled boxes.at n=37A139359
- Records in A153004.at n=44A153838
- a(n) = 16*n^2 - n.at n=27A157446
- a(n) = 64*n^2 - 2*n.at n=13A158067
- a(n) = 784*n^2 - 28.at n=3A158657
- G.f. (x + 1)^10/(x^10 + x^9 - x^7 - x^6 - x^5 - x^4 - x^3 + x + 1).at n=31A173243
- Wiener index of the n-sunlet graph.at n=25A180574
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing odd cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1)<b(2)<b(3)<... . A cycle is said to be odd if it has an odd number of entries. For example, the permutation (152)(347)(6)(8) has 3 increasing odd cycles.at n=60A186761
- E.g.f.: Product_{n>=1} (cos(x^n/n) + sin(x^n/n)).at n=8A209298
- Triangle of coefficients of polynomials v(n,x) jointly generated with A209419; see the Formula section.at n=58A209420
- Triangular array read by rows. T(n,k) is the number of size k connected components over all simple unlabeled graphs with n nodes; n>=1,1<=k<=n.at n=46A224065
- a(n) is the smallest number of grains of sand placed at the center square of a (2n-1) X (2n-1) table so that some grains drop off the table by the end of the diffusion process.at n=41A259013
- Numbers k such that 33*10^k + 1 is prime.at n=23A271107