14988
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 35000
- Proper Divisor Sum (Aliquot Sum)
- 20012
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4992
- Möbius Function
- 0
- Radical
- 7494
- Omega Function (Ω)
- 4
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 89
- 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
- Expansion of e.g.f.: sin(log(1+x))/exp(x).at n=8A009461
- G.f. = continued fraction: A(x)=1/(1-x-x/(1-x^2-x^2/(1-x^3-x^3/(1-x^4-x^4/(...))))).at n=11A088354
- Numbers k such that 2*6^k + 1 is prime.at n=28A120023
- Self-convolution of (1^3, 2^3, 3^3, 4^3, ... ).at n=6A145216
- a(n) = A000041(n) + n*A032741(n).at n=35A168015
- Number of ways to arrange 4 indistinguishable points on an n X n X n triangular grid so that no three points are collinear at any angle.at n=6A194132
- T(n,k) = number of ways to arrange k indistinguishable points on an n X n X n triangular grid so that no three points are collinear at any angle.at n=51A194136
- Number of days after Jan 01 1000 such that the date written in the format DDMMYYYY is palindromic.at n=14A210885
- Number of (n+1) X (n+1) -2..2 symmetric matrices with every 2 X 2 subblock having sum zero and two, three or four distinct values.at n=8A211117
- Number of 2 X 2 matrices having all terms in {-n,...,0,...,n} and determinant >= 2n.at n=6A211152
- Number of (w,x,y) with all terms in {0,...,n} and x != min(|w-x|, |x-y|).at n=24A213502
- Rectangular array: (row n) = b**c, where b(h) = h^3, c(h) = (n-1+h)^3, n>=1, h>=1, and ** = convolution.at n=21A213558
- Sixth derivative of f_n at x=1, where f_n is the n-th of all functions that are representable as x^x^...^x with m>=1 x's and parentheses inserted in all possible ways.at n=26A215836
- Triangle T(n,k) in which n-th row lists the values of the n-th derivative at x=1 of all functions that are representable as x^x^...^x with n x's and parentheses inserted in all possible ways; n>=1, 1<=k<=A000081(n).at n=26A216349
- Triangle T(n,k) in which n-th row lists in increasing order the values of the n-th derivative at x=1 of all functions that are representable as x^x^...^x with n x's and parentheses inserted in all possible ways; n>=1, 1<=k<=A000081(n).at n=25A216350
- Numbers ((binomial(4*p-1,2*p-1) mod p^5)-3)/p^3, where p = prime(n).at n=32A224952
- Numbers M(n) which are the number of terms in the sums of consecutive cubed integers equaling a squared integer, b^3 + (b+1)^3 + ... + (b+M-1)^3 = c^2, for a first term b(n) being an odd squared integer (A016754).at n=11A253707
- a(n) = n!*LaguerreL(n, -3).at n=5A277382
- Number of nX6 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=4A279707
- T(n,k)=Number of nXk 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=49A279709