14943
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21168
- Proper Divisor Sum (Aliquot Sum)
- 6225
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9344
- Möbius Function
- -1
- Radical
- 14943
- Omega Function (Ω)
- 3
- 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
- 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
- Array described in A062704 read by diagonals in direction of creation.at n=42A062705
- The array of A062704 read by diagonals in the 'up' direction.at n=38A062706
- Number of Grand Motzkin paths of length n with no zigzags, that is with no factors UDU and DUD.at n=11A078679
- Matrix cube of triangle A107876; equals the product of triangular matrices: A107876^3 = A107862^-1*A107873.at n=29A107884
- Column 1 of triangle A107884.at n=6A107886
- INVERT transform (with offset) of triple factorials (A008544), where g.f. satisfies: A(x) = 1 + x*[d/dx x*A(x)^3]/A(x)^3.at n=6A112936
- Apocalypse primes: 10^665+a(n) has 666 decimal digits and is prime.at n=8A115983
- Matrix inverse of triangle A122176, where A122176(n,k) = C( k*(k+1)/2 + n-k + 1, n-k) for n>=k>=0.at n=29A121436
- a(n) = (n^3)/2 + (3*n^2)/2 + 3*n + 3.at n=29A127873
- Numbers k such that k and k^2 use only the digits 1, 2, 3, 4 and 9.at n=16A136972
- Number of partitions of n having no more odd than even parts.at n=41A171966
- A symmetrical triangle recursion:q=5;t(n,m,0)=Binomial[n,m];t(n,m,1)=Narayana(n,m);t(n,m,2)=Eulerian(n+1,m);t(n,m,q)=t(n,m,g-2)+t(n,m,q-3).at n=38A176560
- A symmetrical triangle recursion:q=5;t(n,m,0)=Binomial[n,m];t(n,m,1)=Narayana(n,m);t(n,m,2)=Eulerian(n+1,m);t(n,m,q)=t(n,m,g-2)+t(n,m,q-3).at n=42A176560
- Number of distinct lines passing through at least three points in a triangular grid of side n.at n=31A234248
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 291", based on the 5-celled von Neumann neighborhood.at n=28A271131
- Number of nX7 0..1 arrays with every element equal to 1, 2, 4 or 6 king-move adjacent elements, with upper left element zero.at n=9A298054
- 1/(Integral_{x=0..1} x^(x^(x^n)) dx - 1/2), rounded to the nearest integer.at n=29A322009
- Square table, read by antidiagonals: the g.f. for row n is given recursively by (3*n-1)*x*R(n,x) = 1 + (3*n-4)*x - 1/R(n-1,x) for n >= 1 with the initial value R(0,x) = Sum_{k >= 0} A112936(k+1)*x^k.at n=20A355793
- Perimeter-magic hexagons of order 3 with magic sum n.at n=8A380964
- a(n) = 4*n^3 - 6*n^2 + 6*n - 2 + (-1)^n.at n=15A382973