16348
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 29512
- Proper Divisor Sum (Aliquot Sum)
- 13164
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7920
- Möbius Function
- 0
- Radical
- 8174
- 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
- Indices of prime values of heptanacci-Lucas numbers A104621.at n=37A104622
- Least k such that k*p(n)#/5-3+j is prime for j=2,4,8.at n=36A111122
- Partial sum of irregular primes A000928.at n=41A132360
- Number of eight-prime Carmichael numbers less than 10^n.at n=16A174616
- Partial sums of A045699.at n=40A178494
- Monotonic ordering of nonnegative differences 2^i-6^j, for 40>=i>=0, j>=0.at n=46A192116
- Monotonic ordering of nonnegative differences 4^i-6^j, for 40>= i>=0, j>=0.at n=23A192163
- Arises in enumerating Huffman codes, compact trees, and sums of unit fractions.at n=16A194633
- Number of (n+2)X4 0..1 arrays with all rows and columns having a strictly positive second derivative in a quadratic least squares fit.at n=5A223176
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with all rows and columns having a strictly positive second derivative in a quadratic least squares fit.at n=22A223179
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with all rows and columns having a strictly positive second derivative in a quadratic least squares fit.at n=26A223179
- Numbers n such that phi(n) = sigma(n) - reversal(sigma(n)).at n=6A230012
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 229", based on the 5-celled von Neumann neighborhood.at n=13A279994
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 421", based on the 5-celled von Neumann neighborhood.at n=13A282075
- Number of aperiodic compositions of n with relatively prime parts. Number of compositions of n with relatively prime parts and relatively prime run-lengths.at n=14A296302
- Number of nX3 0..1 arrays with each 1 adjacent to 2, 3 or 5 king-move neighboring 1s.at n=6A296958
- Number of nX7 0..1 arrays with each 1 adjacent to 2, 3 or 5 king-move neighboring 1s.at n=2A296962
- T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 2, 3 or 5 king-move neighboring 1s.at n=38A296963
- T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 2, 3 or 5 king-move neighboring 1s.at n=42A296963
- Solution (a(n)) of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1) + b(n); see Comments.at n=33A305330