12546
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 29484
- Proper Divisor Sum (Aliquot Sum)
- 16938
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3840
- Möbius Function
- 0
- Radical
- 4182
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 63
- 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
- Coordination sequence for C_3 lattice: a(n) = 16*n^2 + 2 (n>0), a(0)=1.at n=28A010006
- Expansion of x/(1 - 6*x - 5*x^2).at n=6A015551
- Vampire numbers: (definition 1): n has a nontrivial factorization using n's digits.at n=29A020342
- Restricted permutations.at n=17A036999
- Coefficients of a polynomial used in calculation of A055913.at n=12A055916
- Positions where number of periodic partitions increases.at n=38A059994
- Numbers n such that phi(n) = phi(n-1) - phi(n-2).at n=11A066231
- Third column (m=4) of array A090452.at n=16A090453
- Numbers k such that 10^k + 6*R_k - 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=11A102939
- Numbers m such that m is k*(the sum of decimal digits squared of m), k=153 case.at n=2A117810
- a(n) = 3*n*(5*n-1)/2.at n=40A167469
- a(n) = Sum_{k=0..n} A109613(k)*A005843(n-k).at n=33A171218
- a(n) = number of zeros of the Mertens function M(x) in the interval 0 < x < 10^n (M(x) is the matching summatory function for the Moebius function).at n=6A171910
- a(n) = number of 8-digit primes with digit sum n, where n runs through the non-multiples of 3 in the range [2..71].at n=9A178879
- Triangle read by rows: row n (n>=1) enumerates marked mesh patterns of type R_n^(1,0,2,0).at n=18A182544
- a(n) = Sum_{i+j+k=n, i,j,k >= 1} tau(i)*tau(j)*tau(k), where tau() = A000005().at n=30A191829
- Number of 4-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero and first differences in -n..n.at n=32A208995
- Second diagonal of triangle in A182544.at n=4A211319
- Number of distinct values of the sum of i^2 over 7 realizations of i in 0..n.at n=43A225274
- Least positive integer k such that prime(prime(k)), prime(prime(k*n)), prime(p) and prime(q) form a 4-term arithmetic progression for some pair of primes p and q.at n=20A261462