14240
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 34020
- Proper Divisor Sum (Aliquot Sum)
- 19780
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5632
- Möbius Function
- 0
- Radical
- 890
- Omega Function (Ω)
- 7
- 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
- 76
- 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
- Coordination sequence for A_5 lattice.at n=6A008385
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 59.at n=36A031557
- This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,5). The p-th row (p>=1) contains a(i,p) for i=1 to 5*p-4, where a(i,p) satisfies Sum_{i=1..n} C(i+4,5)^p = 6 * C(n+5,6) * Sum_{i=1..5*p-4} a(i,p) * C(n-1,i-1)/(i+5).at n=13A087109
- a(n) is the least positive integer such that for 1 <= k <= n, the concatenation of the k terms a(n-k+1) through a(n) is a multiple of k.at n=10A096085
- Square array T(n,k) (n >= 1, k >= 0) read by antidiagonals: coordination sequence for root lattice A_n.at n=61A103881
- Number of integer sequences of length n+1 with sum zero and sum of absolute values 12.at n=4A157055
- Numbers k such that 23*10^(k + 2) + 57 is prime.at n=18A160404
- Triangle of coefficients of polynomials defined by Binet form: P(n,x) = ((x + d)^n - (x - d)^n)/(2*d), where d = sqrt(x+4).at n=63A162517
- a(n) = n*(14*n-3).at n=32A185019
- Expansion of x^2*(2-3*x)/(1-x-x^2)^2.at n=20A191830
- Number of n X 4 binary arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two exactly once.at n=4A269007
- T(n,k)=Number of nXk binary arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two exactly once.at n=32A269011
- Number of 5Xn binary arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two exactly once.at n=3A269015
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 377", based on the 5-celled von Neumann neighborhood.at n=6A271462
- Triangle T(n,m) = Sum_{k=0..m} (-1)^(m-k)*binomial(m,k)*binomial(n-m+k-1,m-1)*binomial(2*n-3*m+k-1,n-m), T(n,n)=1.at n=59A271776
- Irregular triangle read by rows. Row n gives the coefficients of the polynomial multiplying the exponential function in the e.g.f. of the (n+1)-th diagonal sequences of triangle A008459 (Pascal squares). T(n,k) for n >= 0 and k = 0..2*n.at n=31A290310
- p-INVERT of (1,0,1,0,0,0,0,...), where p(S) = (1 - 2 S)^2.at n=8A291732
- Constant term in the expansion of (Sum_{k=0..n} k*(x^k + x^(-k)))^5.at n=3A318119
- Square array A(n,k), n>=0, k>=0, read by antidiagonals, where A(n,k) is the constant term in the expansion of (Sum_{j=0..n} j*(x^j + x^(-j)))^k.at n=39A322549
- Numbers k such that 445*2^k+1 is prime.at n=25A323151