16608
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 43848
- Proper Divisor Sum (Aliquot Sum)
- 27240
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5504
- Möbius Function
- 0
- Radical
- 1038
- Omega Function (Ω)
- 7
- Little Omega Function (ω)
- 3
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
- 66
- 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 points on surface of truncated cube: a(n) = 46*n^2 + 2 for n > 0.at n=19A005911
- Generalized Fibonacci numbers A_{n,4}.at n=36A006209
- Row sums of triangle A096815, in which A096815(n,k) equals the k-th term of the convolution of the two prior rows indexed by (n-k) and k.at n=18A096816
- Number of 2-anisohedral polyiamonds of order n.at n=23A121308
- Number of increasing sequences of n integers x(1),...,x(n) with values in 1..3*n such that x(j) divides x(k) iff j divides k.at n=42A180380
- Expansion of 1 + Sum_{n>=1} (x^(n^2) / Product_{k>=n} (1 - x^k)).at n=36A188216
- Number of (n+1) X 6 0..1 arrays with the number of clockwise edge increases in every 2 X 2 subblock differing from each horizontal or vertical neighbor.at n=12A205190
- Number of n X 3 0..2 arrays with new values 0..2 introduced in row major order and no element equal to more than one of its immediate leftward or upward or left-upward diagonal neighbors.at n=3A208562
- Number of nX4 0..2 arrays with new values 0..2 introduced in row major order and no element equal to more than one of its immediate leftward or upward or left-upward diagonal neighbors.at n=2A208563
- T(n,k)=Number of nXk 0..2 arrays with new values 0..2 introduced in row major order and no element equal to more than one of its immediate leftward or upward or left-upward diagonal neighbors.at n=17A208567
- T(n,k)=Number of nXk 0..2 arrays with new values 0..2 introduced in row major order and no element equal to more than one of its immediate leftward or upward or left-upward diagonal neighbors.at n=18A208567
- Number of 2 X 2 matrices having all terms in {-n,...,0,...,n} and determinant n.at n=28A211140
- Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 6, n >= 2.at n=24A213070
- a(n) = n^2 + 2*n + 2^n.at n=14A220425
- Years >= 1801 in which Christmas falls in Sukkot.at n=23A222419
- Number of (n+2)X(4+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000101 or 00001011.at n=16A261551
- Union of all unique coefficients of all powers of the g.f. A(x) of this sequence, starting with A(0)=2 and A'(0)=3.at n=66A262975
- G.f.: 2*q * Product_{n>=1} (1 + q^(2*n))/((1 + q^n)*(1 + q^(2*n-1))*(1 + q^(4*n))) in powers of q.at n=30A293132
- Number of 4-cycles in the n-polygon diagonal intersection graph.at n=29A300552
- Number T(n,k) of colored integer partitions of n using all colors of a k-set such that parts i have distinct color patterns in arbitrary order and each pattern for a part i has i colors in (weakly) increasing order; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=34A309973