16340
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 36960
- Proper Divisor Sum (Aliquot Sum)
- 20620
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6048
- Möbius Function
- 0
- Radical
- 8170
- 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
- 53
- 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 the n-th decimal palindrome into distinct decimal palindromes.at n=42A091585
- Triangle T(n,k) = T(n-1, k) + T(n-1, k-1) + 7*T(n-2, k-1), read by rows.at n=47A153520
- Triangle T(n,k) = T(n-1, k) + T(n-1, k-1) + 7*T(n-2, k-1), read by rows.at n=52A153520
- Number of lower triangles of a 3 X 3 0..n array with each element differing from all of its diagonal, vertical, antidiagonal and horizontal neighbors by two or less.at n=16A195249
- Record-breaking values, for increasing positive integers k == 1 or 5 mod 6, of the conjectured length of the longest primitive cycle(s) of positive integers under iteration by the Collatz-like 3x+k function.at n=30A226670
- Number of binary strings of length 2n which contain the ones' complement of each of their two halves.at n=12A237500
- Expansion of Product_{k>=1} 1/(1 - x^(2*k+3))^k.at n=52A263352
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 33", based on the 5-celled von Neumann neighborhood.at n=13A276966
- Number of n X 4 0..1 arrays with each 1 horizontally or vertically adjacent to 0, 2, 3 or 4 1's.at n=4A295602
- Number of nX5 0..1 arrays with each 1 horizontally or vertically adjacent to 0, 2, 3 or 4 1s.at n=3A295603
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally or vertically adjacent to 0, 2, 3 or 4 1s.at n=31A295606
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally or vertically adjacent to 0, 2, 3 or 4 1s.at n=32A295606
- Number of maximal subsets of {1..n} containing n such that every pair of distinct elements has a different quotient.at n=29A325869
- a(1) = 6; for n>1, a(n) = 7 * a(n-1) + 7 - n.at n=4A353098
- Positions of +4's in A346242.at n=47A354814
- Array read by ascending antidiagonals: A(1, k) = k; for n > 1, A(n, k) = (k + 1)*A(n-1, k) + k + 1 - n, with k > 0.at n=50A363365
- a(n) = Sum_{i=2..n-1} i*n^(i-2).at n=7A370671
- Numbers k such that 128 * 3^k - 1 is prime.at n=26A384228