14385
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 26496
- Proper Divisor Sum (Aliquot Sum)
- 12111
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6528
- Möbius Function
- 1
- Radical
- 14385
- Omega Function (Ω)
- 4
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- Coefficients for step-by-step integration.at n=4A002404
- sec(sec(x)*tanh(x))=1+1/2!*x^2+9/4!*x^4+297/6!*x^6+14385/8!*x^8...at n=4A012838
- a(n) = 11^n - n^4.at n=4A024131
- Primitive elements of A065607.at n=13A120692
- Elements of A065607 from primitive triples.at n=19A120693
- Numbers k for which nontrivial positive magic squares of exactly 9 different orders with magic sum k exist. For a definition of nontrivial positive magic squares, see A125005.at n=32A125016
- a(n) = n*(n^2 + 2*n - 1)/2.at n=29A127736
- Refines A075197(n): number of partitions of n balls of n colors. The refinement has shape A000041(n).at n=36A130273
- a(n) = 11^n - 4^n.at n=4A139742
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (0, 1, 1), (1, 0, 0), (1, 0, 1)}.at n=7A151079
- 3 times 10-gonal (or decagonal) numbers: a(n) = 3*n*(4*n-3).at n=35A152767
- a(n) = 64*n^2 - n.at n=14A157948
- a(n) = 225*n^2 - 15.at n=7A158559
- Triangle of numerators of coefficients of the polynomial Q^(2)_m(n) defined by the recursion Q^(2)_0(n)=1; for m>=1, Q^(2)_m(n) = Sum_{i=1..n} i^2*Q^(2)_(m-1)(i). For m>=0, the denominator for all 3*m+1 terms of the m-th row is A202367(m+1).at n=16A175669
- A triangle of polynomial coefficients:p(x,n)=Sum[(2*k - 1)^n*Binomial[x, k], {k, 0, Infinity}]/2^x.at n=59A176669
- Numbers n such that (n^6 + 1091)/4 is prime.at n=8A181112
- Numbers n with property that (n+1)*prime(n+1)-n*prime(n) is a perfect square s^2.at n=30A181283
- Majority value maps: number of nX4 binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal, vertical and antidiagonal neighbors in a random 0..1 nX4 array.at n=3A220306
- T(n,k)=Majority value maps: number of nXk binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal, vertical and antidiagonal neighbors in a random 0..1 nXk array.at n=24A220308
- Products p*q*r*s of distinct primes for which (p*q*r*s + 1)/2 is prime.at n=28A234501