16334
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 24504
- Proper Divisor Sum (Aliquot Sum)
- 8170
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8166
- Möbius Function
- 1
- Radical
- 16334
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- 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
- Coordination sequence for alpha-Mn, Position Mn4.at n=33A009953
- Ordered sequence of distinct terms of the form floor(x^i * floor(x^j)), i,j >= 0, where x = sqrt(7).at n=31A022771
- Integer part of ((4th elementary symmetric function of 2,3,...,n+4)/(2nd elementary symmetric function of 2,3,...,n+4)).at n=26A024181
- Number of ways to tile a 5 X n area with 1 X 1 and 2 X 2 tiles.at n=8A054855
- Number of ways to tile an 8 X n rectangle with 1 X 1 and 2 X 2 tiles.at n=5A063652
- Number of partner-graph triangle-free perfect graphs on n nodes.at n=9A123444
- Triangle read by rows: row n is the first row of the matrix M[n]^(n-1), where M[n] is the n X n tridiagonal matrix with main diagonal (1,4,4,...) and super- and subdiagonals (1,1,1,...).at n=36A124576
- Number of n X n binary matrices, symmetric under horizontal reflection, with no more than 1 one in any 2 X 2 subblock.at n=7A141482
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (0, -1, 1), (0, 0, 1), (1, 1, -1), (1, 1, 1)}.at n=7A150897
- The number of sigma-admissible subsets of {1,2,...,n} as defined by Marzuola-Miller.at n=25A158449
- T(n,k) = Half the number of (n+1) X (k+1) 0..2 arrays with every 2 X 2 subblock diagonal sum differing from its antidiagonal sum by more than 2.at n=30A179618
- T(n,k) = Half the number of (n+1) X (k+1) 0..2 arrays with every 2 X 2 subblock diagonal sum differing from its antidiagonal sum by more than 2.at n=33A179618
- Number of n X n 0..3 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=5A201444
- Number of nX6 0..3 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=5A201449
- T(n,k)=Number of nXk 0..3 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=60A201451
- Numbers which are the roots of distinct not-previously-encountered side-trees ("tendrils") sprouting from the side of the infinite beanstalk (see A213730).at n=35A218612
- Number of idempotent 3X3 0..n matrices.at n=34A222822
- Number of (n+1) X (3+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=8A250778
- Number of inversion sequences avoiding pattern 120.at n=8A263778
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 870", based on the 5-celled von Neumann neighborhood.at n=37A273705