14392
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 30960
- Proper Divisor Sum (Aliquot Sum)
- 16568
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6144
- Möbius Function
- 0
- Radical
- 3598
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 3
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
- 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
- Number of up steps in all length n left factors of Dyck paths.at n=13A014314
- Numbers k such that k divides the (right) concatenation of all numbers <= k written in base 15 (most significant digit on right).at n=14A061944
- Structured truncated octahedral numbers.at n=13A100155
- A triangular array related to A077028 and distributing the values of A007582.at n=48A110552
- Triangle T(n,k) = 2*T(n-1, k-1) + 2*T(n-1, k), read by rows.at n=48A142595
- Triangle T(n,k) = 2*T(n-1, k-1) + 2*T(n-1, k), read by rows.at n=51A142595
- Triangle read by rows: expansion of p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 1)*Sum[Binomial[n, m]*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=39A146765
- Triangle read by rows: expansion of p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 1)*Sum[Binomial[n, m]*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=41A146765
- a(n) = 225*n^2 - n.at n=7A156813
- a(n) = 686*n - 14.at n=20A157363
- a(n) = 900*n^2 - 2*n.at n=3A158408
- a(n) = 64*n^2 - 8.at n=14A158487
- Numbers k such that k^3 divides 15^(k^2) - 1.at n=38A177915
- Fundamental discriminants of real quadratic number fields with class number 10.at n=34A218160
- G.f.: (2*x^2+4*x+3)/((2*x+2)*sqrt(-4*x^3-4*x^2+1))-1/(2*x+2).at n=13A247171
- Number of (4+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=39A250658
- 40-gonal numbers: a(n) = 38*n*(n-1)/2 + n.at n=28A261191
- Numbers n such that Bernoulli number B_{n} has denominator 870.at n=46A272185
- 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 6", based on the 5-celled von Neumann neighborhood.at n=13A277933
- 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 398", based on the 5-celled von Neumann neighborhood.at n=13A281758