16968
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
- 3
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 48960
- Proper Divisor Sum (Aliquot Sum)
- 31992
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4800
- Möbius Function
- 0
- Radical
- 4242
- 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
- 110
- 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 3n-1 into n nonnegative integers each no more than 6.at n=26A001978
- Number of homogeneous primitive partition identities with largest part n.at n=10A007343
- a(n+1) = a(n) converted to base 9 from base 6 (written in base 10).at n=11A023386
- Least k such that k*n^n +/- 1 are twin primes.at n=31A076810
- a(n) = (n+1)*(n+2)^2*(n+3)*(n+4)*(5*n^2 + 18*n + 15)/720.at n=6A107962
- Pentanacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5) if n>=5, and a(n) = n otherwise.at n=16A135056
- Number of n-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero with no three beads in a row equal.at n=5A209336
- Number of n-bead necklaces labeled with numbers -6..6 allowing reversal, with sum zero with no three beads in a row equal.at n=5A209342
- T(n,k) is the number of n-bead necklaces labeled with numbers -k..k allowing reversal, with sum zero with no three beads in a row equal.at n=60A209344
- Number of 6-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero with no three beads in a row equal.at n=5A209347
- Number of length n+3 0..n arrays with no four elements in a row with pattern aabb (possibly a=b) and new values 0..n introduced in 0..n order.at n=5A242542
- Number of length n+3 0..6 arrays with no four elements in a row with pattern aabb (possibly a=b) and new values 0..6 introduced in 0..6 order.at n=5A242547
- Number of (n+2) X (5+2) 0..1 arrays with no 3 X 3 subblock diagonal sum 0 and no antidiagonal sum 3 and no row sum 0 or 3 and no column sum 0 or 3.at n=17A258963
- G.f.: 1/((1-t^11)^2*(1-t)*(1-t^3)*(1-t^5)*(1-t^7)*(1-t^9)*(1-t^13)*(1-t^15)*(1-t^17)*(1-t^19)*(1-t^21)).at n=64A266751
- Numbers k such that 5*10^k + 59 is prime.at n=25A276492
- Number of nX4 0..1 arrays with every element equal to 0, 2, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=8A299454