16892
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 30576
- Proper Divisor Sum (Aliquot Sum)
- 13684
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8160
- Möbius Function
- 0
- Radical
- 8446
- Omega Function (Ω)
- 4
- 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
- 159
- 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
- Expansion of (1+4*x)/(1-x-3*x^2).at n=11A105963
- Number of 4-step one space at a time bishop's tours on an n X n board summed over all starting positions.at n=23A187157
- Number of (n+1)X(n+1) 0..3 arrays with every 2X3 or 3X2 subblock having exactly three clockwise edge increases.at n=1A206319
- Number of (n+1)X3 0..3 arrays with every 2X3 or 3X2 subblock having exactly three clockwise edge increases.at n=1A206321
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X3 or 3X2 subblock having exactly three clockwise edge increases.at n=4A206327
- Number of nX4 0..1 arrays with no more than floor(nX4/2) elements unequal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..1 order.at n=6A222631
- Number of n X 7 0..1 arrays with no more than floor(n X 7/2) elements unequal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..1 order.at n=3A222634
- T(n,k)=Number of nXk 0..1 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..1 order.at n=48A222635
- T(n,k)=Number of nXk 0..1 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..1 order.at n=51A222635
- Irregular triangle read by rows: T(n,k) = number of independent vertex subsets of size k of the graph g_n obtained by attaching two pendant edges to each vertex of the ladder graph L_n (i.e., L_n is the 2 X n grid graph; 0 <= k <= 4n+1).at n=33A235117
- Irregular triangle read by rows: T(n,k) = number of independent vertex subsets of size k of the graph g_n obtained by attaching two pendant edges to each vertex of the ladder graph L_n (i.e., L_n is the 2 X n grid graph; 0 <= k <= 4n+1).at n=39A235117
- a(n) = Sum_{i=1..n} (-1)^{i+1} prime(i)^2, where prime(k) denotes the k-th prime: alternating sum of the squares of the first n primes.at n=38A240860
- Number of partitions p of n such that 2*(number of even numbers in p) = (number of odd numbers in p).at n=48A241653
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 33", based on the 5-celled von Neumann neighborhood.at n=30A269812
- Number of distinct cardinalities of orbits of lattice points under the automorphism group of the n-dimensional integer lattice.at n=38A270950
- Number of minimal dominating sets in the n-gear graph.at n=13A290378
- G.f.: Product_{n=-oo..+oo} ( 1 + x^n*(1 - x^n)^n ).at n=35A293602
- Array read by antidiagonals: T(m,n) = number of Eulerian orientations of the torus grid graph C_m X C_n.at n=31A298119
- Array read by antidiagonals: T(m,n) = number of Eulerian orientations of the torus grid graph C_m X C_n.at n=32A298119
- Number of Eulerian orientations of the torus grid graph C_4 X C_n.at n=4A298201