12690
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
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 34560
- Proper Divisor Sum (Aliquot Sum)
- 21870
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3312
- Möbius Function
- 0
- Radical
- 1410
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 81
- 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
- Molien series for A_10.at n=38A008633
- Number of partitions of n into at most 10 parts.at n=38A008639
- Expansion of 1/(1-x^5-x^6-x^7-x^8-x^9-x^10-x^11-x^12-x^13-x^14).at n=42A017845
- Theta series of A*_9 lattice.at n=64A023921
- Number of partitions of n in which the greatest part is 10.at n=48A026816
- Numbers m such that 2^m reversed is prime.at n=27A057708
- Duplicate of A023921.at n=64A072840
- Pair the natural numbers such that the n-th pair is (k, k+p(n)) where k is the smallest number not occurring earlier and p(n) is the n-th prime. (1, 3), (2, 5), (4, 9), (6, 13), (7, 18), (8, 21), (10, 27), (11, 30), (12, 35), (14, 43), ... This is the sequence of the product of the members of every pair.at n=41A075316
- Consider recurrence b(0) = (2n+1)/2, b(n) = b(0)*floor(b(n-1)); sequence gives first integer reached.at n=21A087675
- Number of permutations of length n which avoid the patterns 1243, 1342, 4312.at n=9A116770
- Number of line segments connecting exactly 10 points in an n x n grid of points.at n=41A177726
- Numbers k with equal remainders of (product of divisors of k) mod (sum of divisors of k) and (product of proper divisors of k) mod (sum of proper divisors of k).at n=33A192035
- Places n such that the two remainders A187680(n) and A191906(n) are both zero.at n=12A192853
- a(n) = n*(14*n + 3).at n=30A195025
- Number of 0..n arrays x(0..6) of 7 elements with zero 5th differences.at n=14A200085
- Number of possibilities of getting a prime sum when rolling n six-sided dice.at n=6A224397
- Largest number k such that phi(k) = A007374(n).at n=40A224532
- Number of (n+1)X(2+1) 0..3 arrays with the maximum plus the lower median minus the minimum of every 2X2 subblock equal.at n=1A237310
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the lower median minus the minimum of every 2X2 subblock equal.at n=4A237315
- G.f.: 1 / Product_{n>=0} (1 - x^(n+4))^((n+1)*(n+2)*(n+3)/3!).at n=18A264924