14388
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 36960
- Proper Divisor Sum (Aliquot Sum)
- 22572
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4320
- Möbius Function
- 0
- Radical
- 7194
- Omega Function (Ω)
- 5
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 120
- 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 partitions of n, with two kinds of 1, 2, 3 and 4.at n=20A000710
- Expansion of e.g.f.: exp(sin(x))/exp(x).at n=12A009209
- a(n) = 100*n^2 - n.at n=11A157659
- a(n) = 400*n^2 - 2*n.at n=5A158316
- a(n) = 144*n^2 - 12.at n=9A158543
- Number of 1..11 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1.at n=3A171285
- Number of 1..n integer arrays v[1..4] of length 4 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..3.at n=10A171341
- Number of 2 X 2 matrices having all elements in {-n,...,n} and determinant 1.at n=38A209982
- Number of -1..1 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two, four, five, six or seven distinct values for every i,j,k<=n.at n=10A211532
- G.f. satisfies: A(x) = x + A( A(x)^2/(1 + A(x)) ).at n=12A213263
- Number of nX2 0..3 arrays with no more than floor(nX2/2) elements equal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..3 order.at n=4A222825
- T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements equal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..3 order.at n=16A222828
- T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements equal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..3 order.at n=19A222828
- Number of collinear point triples on a centered hexagonal grid of size n.at n=7A241222
- a(n) is the smallest number of grains of sand placed at the center square of a (2n-1) X (2n-1) table so that some grains drop off the table by the end of the diffusion process.at n=44A259013
- Numbers m with m-1, m+1 and prime(m)+2 all prime.at n=29A259539
- Numbers missing from A001033 despite satisfying the necessary congruence conditions (see comments).at n=17A274470
- Numbers missing from A134419 despite satisfying the necessary congruence conditions (see comments).at n=39A274471
- Number of n X 2 0..1 arrays with every element both equal and not equal to some elements at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) or (1,0), with upper left element zero.at n=9A278274
- Number of vertices in a hexagon when n internal hexagons are drawn between the 6n points that divide each side into n+1 equal parts.at n=49A357197