16280
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 41040
- Proper Divisor Sum (Aliquot Sum)
- 24760
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5760
- Möbius Function
- 0
- Radical
- 4070
- Omega Function (Ω)
- 6
- 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
- 159
- 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
- a(n) = 8*a(n-2) - 9*a(n-4).at n=12A002536
- exp(arctanh(x)*sin(x))=1+2/2!*x^2+16/4!*x^4+350/6!*x^6+16280/8!*x^8...at n=4A012721
- Even octagonal numbers: a(n) = 4*n*(3*n-1).at n=37A014642
- a(n) = dot_product(1,2,...,n)*(3,4,...,n,1,2).at n=34A026037
- Nextprime(4^n)-nextprime(2^n).at n=7A037130
- Sums of 4 distinct powers of 5.at n=21A038476
- a(n) = (n!)^3 * Sum_{i=1..n} 1/i^3.at n=3A066989
- Number of odd entries in A004001 that are <= 2^n.at n=15A095902
- Octagonal numbers for which the product of the digits is also an octagonal number.at n=32A117083
- a(n) = ( (4 + sqrt(7))^n - (4 - sqrt(7))^n )/(2*sqrt(7)).at n=5A154245
- First differences of A160379.at n=23A163989
- Partial sums of A165271.at n=41A165273
- For positive n with prime decomposition n = Product_{j=1..m} (p_j^k_j) define A_n = Sum_{j=1..m} (p_j*k_j) and B_n = Sum_{j=1..m} (p_j^k_j). This sequence gives those n for which A_n and B_n are both prime and B_n = A_n + 2 (i.e., form a twin prime pair).at n=33A185718
- Number of (n+1) X (1+1) 0..2 arrays with the maximum plus the lower median of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=4A237456
- Number of (n+1)X(5+1) 0..2 arrays with the maximum plus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=0A237460
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=10A237463
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=14A237463
- Triangle, read by rows, with row n forming the coefficients in Product_{k=0..n} (1 + k^3*x).at n=13A249677
- Expansion of Product_{k>=1} (1 - x^(8*k))/(1 - x^k).at n=37A261775
- Triangle read by rows, Stirling cycle numbers of order 3, T(n,n) = 1, T(n,k) = 0 if k<0 or k>n, otherwise T(n,k) = T(n-1,k-1)+(n-1)^3*T(n-1,k), for n>=0 and 0<=k<=n.at n=17A269947