14371
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16432
- Proper Divisor Sum (Aliquot Sum)
- 2061
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12312
- Möbius Function
- 1
- Radical
- 14371
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 71
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Pisot sequence T(14,23), a(n)=[ a(n-1)^2/a(n-2) ].at n=15A010922
- a(n) = floor( n*(n-1)*(n-2)/20 ).at n=67A011902
- Expansion of 1/sqrt((1-x)^2 - 4*x^4).at n=17A098482
- Number of distinct products i*j*k*l for 1 <= i < j < k < l <= n.at n=37A100438
- Numbers k such that 10^k + 5*R_k + 4 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=22A102938
- Rectangular table, read by antidiagonals, such that the o.g.f. of row n, R_n(y), satisfies: R_n(y) = Sum_{k>=0} y^k * R_k(y)^n for n>=0, with R_0(y) = 1/(1-y).at n=63A124460
- Row 2 of rectangular table A124460.at n=8A124462
- Ulam's spiral (NNW spoke).at n=30A143860
- G.f. 1/(1-sum(n=1,N,x^(n*(3*n-1)/2))).at n=35A181324
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 270", based on the 5-celled von Neumann neighborhood.at n=13A280465
- Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 398", based on the 5-celled von Neumann neighborhood.at n=16A281759
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 609", based on the 5-celled von Neumann neighborhood.at n=14A283285
- a(n) = Sum_{i=0..n} Sum_{j=0..n} Sum_{k=0..n} (-1)^(i+j+k) * (i+j+k)!/(i!*j!*k!).at n=4A307318
- A(n,k) = Sum_{i_1=0..n} Sum_{i_2=0..n} ... Sum_{i_k=0..n} (-1)^(i_1 + i_2 + ... + i_k) * multinomial(i_1 + i_2 + ... + i_k; i_1, i_2, ..., i_k), square array A(n,k) read by antidiagonals, for n >= 0, k >= 0.at n=32A308322
- Number of compositions (ordered partitions) of the n-th n-gonal number into n-gonal numbers.at n=5A337764
- a(0) = 1; a(n) = Sum_{k=1..n} binomial(n,k)^2 * a(k-1).at n=6A342196
- G.f. A(x) satisfies: A(x) = (1 - x) / (1 - 2 * x - x^2 - x^2 * A(x)).at n=9A349185