14980
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 36288
- Proper Divisor Sum (Aliquot Sum)
- 21308
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5088
- Möbius Function
- 0
- Radical
- 7490
- 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
- 164
- 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
- Convolution of (F(2), F(3), F(4), ...) and A014306.at n=19A023656
- dot_product(n,n-1,...2,1)*(6,7,...,n,1,2,3,4,5).at n=34A026063
- Sum of the digits of the n-th Mersenne prime (A000668).at n=22A066538
- Numbers k such that k+1 is composite and divides 3^k-2^k.at n=30A068410
- Non-balanced numbers in A015771.at n=27A078549
- Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n and containing a total of k level steps H in all DHH...HU's, where U=(1,1), H=(1,0) and D=(1,-1) (can be easily expressed using RNA secondary structure terminology).at n=62A097107
- Indices n such that the 3 X 3 matrix with components (row by row) prime(n+k), 0 <= k <= 8, has zero determinant.at n=19A117345
- Triangle T(n,k) read by rows ; multiply row n of Pascal's triangle (A007318) by A024175(n).at n=31A120493
- Triangle T(n,k) read by rows ; multiply row n of Pascal's triangle (A007318) by A024175(n).at n=32A120493
- Zero followed by partial sums of A059100, starting at n=1.at n=35A145068
- a(n) = 1000*n - 20.at n=14A157515
- Sum of all numbers from 2*n-1 up to prime(n).at n=43A161626
- Number of 3-step one space at a time bishop's tours on an n X n board summed over all starting positions.at n=36A187156
- The second rank moment function N_2(n).at n=18A220908
- Number of nX5 0..1 arrays with rows, columns and antidiagonals unimodal and diagonals nondecreasing.at n=7A223767
- E.g.f.: exp( Sum_{n>=1} x^(2*n) / n^2 ) = Sum_{n>=0} a(n)*x^(2*n)/(2*n)!.at n=4A226837
- Number of (n+1) X (2+1) 0..2 arrays colored with the difference of the upper median and the lower median in each 2 X 2 subblock.at n=2A236029
- Number of (n+1) X (3+1) 0..2 arrays colored with the difference of the upper median and the lower median in each 2 X 2 subblock.at n=1A236030
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the difference of the upper median and the lower median in each 2X2 subblock.at n=7A236035
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the difference of the upper median and the lower median in each 2X2 subblock.at n=8A236035