15334
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 27216
- Proper Divisor Sum (Aliquot Sum)
- 11882
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6400
- Möbius Function
- 1
- Radical
- 15334
- Omega Function (Ω)
- 4
- 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
- 58
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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) = 3*n^3 + 2*n^2 + n.at n=17A067389
- Poincaré series [or Poincare series] P(C_{4,2}; x).at n=14A124612
- Main diagonal of array A[k,n] = n-th sum of 3 consecutive k-gonal numbers, k>2.at n=21A130423
- Number of (n+1)X(n+1) -10..10 symmetric matrices with every 2X2 subblock having sum zero and three or four distinct values.at n=2A211818
- a(n) = Sum_{i=0..n} digsum(i)^4, where digsum(i) = A007953(i).at n=10A231689
- a(n) = (n + 1)*(6*n^4 - 21*n^3 + 31*n^2 - 31*n + 30)/30.at n=10A267691
- G.f.: Im((2*i; x)_oo), where (a; q)_oo is the q-Pochhammer symbol, i = sqrt(-1).at n=40A292140
- Number of partitions of n into at most 1^2 copy of 1, 2^2 copies of 2, 3^2 copies of 3, ... .at n=43A303944
- a(n) is the least number k for which A330437(k) = n.at n=28A330704
- a(n) is the total number of down steps between the (n-1)-th and n-th up steps in all 3_2-Dyck paths of length 4*n. A 3_2-Dyck path is a lattice path with steps (1, 3), (1, -1) that starts and ends at y = 0 and stays above the line y = -2.at n=5A334980
- a(n) = (21*n^2 + 9*n + 2)/2.at n=38A381109
- Least composite squarefree numbers k > n such that p + n divides k - n, for each prime p dividing k.at n=33A382484