16698
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
- 24
- Divisor Sum
- 38304
- Proper Divisor Sum (Aliquot Sum)
- 21606
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4840
- Möbius Function
- 0
- Radical
- 1518
- 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
- 115
- 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) = T(2*n+2,n), array T as in A055216.at n=8A055218
- Partial sums of n 3-spaced triangular numbers beginning with t(2), e.g., a(2) = t(2) + t(5) = 3 + 15 = 18.at n=21A085789
- Fifth column (m=4) of (1,3)-Pascal triangle A095660.at n=21A095661
- Number of words of length n+1 created with the letters a,b,c with more c's than b's and more b's than a's.at n=10A115752
- Twice partition numbers.at n=32A139582
- a(n) = 6*n^2*(2*n + 1).at n=11A190705
- Number of (w,x,y,z) with all terms in {1,...,n} and |x-y|=|y-z|+1.at n=23A212680
- Number of length 6 1..(n+2) arrays with no leading or trailing partial sum equal to a prime and no consecutive values equal.at n=8A254223
- T(n,k)=Number of length n+k 0..2 arrays with at most two downsteps in every k consecutive neighbor pairs.at n=36A255622
- Number of length n+1 0..2 arrays with at most two downsteps in every n consecutive neighbor pairs.at n=8A255623
- Number of partitions of 7n into exactly 4 parts.at n=19A256329
- Number of partitions of 3n into at most 4 parts.at n=43A256524
- a(n) = n*(67*n - 89)/2.at n=23A263227
- a(n) = Product_{d|n, d>1} prime(A318881(d)), where A318881(d) records the prime signature of A000010(d).at n=51A319344
- Number of integer partitions of n with no difference -2.at n=40A350842
- Primitive terms of A359565: terms of A359565 with no proper divisor in A359565.at n=39A359566
- a(n) = [x^n] 1/(Sum_{k>=0} x^(k^2))^n.at n=10A363780
- Number of fixed (4,2)-polyominoids with n cells.at n=3A366335
- a(n) is the number of integer triples (x,y,z) satisfying a system of linear inequalities and congruences specified in the comments.at n=32A370349
- Square array read by descending antidiagonals: A(n,k) is the number of fixed n-dimensional (n,2)-polyominoids, n >= 2, of size k >= 1.at n=17A385715