14189
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16224
- Proper Divisor Sum (Aliquot Sum)
- 2035
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12156
- Möbius Function
- 1
- Radical
- 14189
- 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
- 58
- 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
- Sum of next n primes.at n=16A007468
- Numbers k where cos(k) decreases monotonically to 0.at n=23A046957
- Numbers k where sin(k) increases monotonically to 1 (or cosec(k) decreases).at n=27A046959
- Fourth column (r=3) of FS(3) staircase array A062745.at n=41A062748
- Least number requiring the base n to produce a prime by base reversal.at n=18A075244
- Moebius transform of tetrahedral numbers.at n=42A117108
- A001044(n)-A134354(n).at n=5A134355
- Triangle formed by coefficients of the expansion of p(x,n) = (1-x)^(2*n + 1)*Sum_{j >= 0} (1 +j +j^2)^n * x^j.at n=27A156985
- Triangle formed by coefficients of the expansion of p(x,n) = (1-x)^(2*n + 1)*Sum_{j >= 0} (1 +j +j^2)^n * x^j.at n=33A156985
- Coefficients of infinite sum polynomials; p(x,n)=If[Mod[n, 2] == 1, (1 - x)^(n + 1)*Sum[(k + 1)*(1 + k + k^2)^Floor[(n - 1)/2]* x^k, {k, 0, Infinity}], (1 - x)^(n + 1)*Sum[(1 + k + k^2)^Floor[n/2]*x^ k, {k, 0, Infinity}]].at n=52A169625
- Number of (w,x,y,z) with all terms in {1,...,n} and w^3>=x^3+y^3+z^3.at n=17A212100
- a(n) = (-1)^(n-3)*binomial(n,3) - 1.at n=42A216414
- Hilltop maps: number of nX7 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..2 nX7 array.at n=1A218591
- T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..2 nXk array.at n=29A218592
- Hilltop maps: number of 2Xn binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..2 2Xn array.at n=6A218593
- Number of cyclotomic cosets of 3 mod 10^n.at n=42A220018
- Numerator of Sum_{k=1..n} 1/(k(k+1)(k+2)(k+3)) = Sum_{k=1..n} 1/Pochhammer(k,4).at n=42A230339
- Number of (1+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.at n=39A250756
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 901", based on the 5-celled von Neumann neighborhood.at n=21A273744
- Least integer k such that k/2^n > sqrt(3).at n=13A293325