14586
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 36288
- Proper Divisor Sum (Aliquot Sum)
- 21702
- 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
- -1
- Radical
- 14586
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- 164
- 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
- a(n) = (5*n + 4)*binomial(n+7,7)/4.at n=6A056125
- a(n) is the n-th primorial divided by squarefree kernel of corresponding central binomial coefficient.at n=6A056607
- Least common multiple of all (k+1)'s, where the k's are the positive divisors of n.at n=49A057643
- Integers n > 7059 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 7059.at n=32A063058
- Sum of absolute values of terms in n-th row of A065432.at n=17A065441
- Numbers of the form (2i)! (2j)! / i! j! (i + j)!.at n=42A068514
- a(1)=1, a(n) is the smallest integer > a(n-1) such that the sum of elements of the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n*(n+1)/2 the n-th triangular number.at n=20A071184
- a(n) = number of partitions of n wherein the sum of the 1's is no more than the sum of the other parts.at n=34A083690
- Number of symmetric non-crossing connected graphs on n equidistant nodes on a circle.at n=11A089073
- a(n) = round(10000*log(n/10)).at n=42A104077
- Numbers k such that k and 5*k, taken together, are pandigital.at n=4A115925
- Number of partitions of n in which each part, with the possible exception of the largest, occurs at least twice.at n=46A116931
- Numbers with no 1's in base 3 & 4 expansions.at n=40A117496
- Number triangle T(n,k) = lcm(1,..,2*n+2)/lcm(1,..,2*k+2).at n=39A120105
- Self-convolution of A120588, such that a(n) = 3*A120588(n) for n >= 2.at n=10A120589
- Array of T(n,m)=1*5*...*(4n-3)*3*7*...*(4m-1)*2^(n+m)/(n+m)! by antidiagonals.at n=39A122882
- a(2n) = Cat(n), a(2n+1) = 3*Cat(n), where Cat(n) = binomial(2n,n)/(n+1) are the Catalan numbers (A000108).at n=19A126324
- Least number k such that all coefficients of k*B(n,x), the n-th Bernoulli polynomial, are integers.at n=50A144845
- Denominator of the polynomial A_l(x) = Sum_{d=1..l-1} x^(l-d)/d for index l=2n+1 evaluated at x=10.at n=8A145629
- a(n) = largest value of the function rad(m*n*(n - m)) n=2,3,4,..., 0 < m < n where the function rad(k) (also called radical(k)) is the product of distinct prime divisors of k.at n=37A147299