16336
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 31682
- Proper Divisor Sum (Aliquot Sum)
- 15346
- 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
- 2042
- Omega Function (Ω)
- 5
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 53
- 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) = 4*8^n - 3*2^n.at n=4A020537
- Numerators of continued fraction convergents to sqrt(255).at n=5A041478
- Interprimes which are of the form s*prime, s=16.at n=15A075291
- Number of (s(0), s(1), ..., s(n)) such that 0 < s(i) < 6 and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 2, s(n) = 2.at n=10A094297
- 10th-order Fibonacci numbers: a(n+1) = a(n)+...+a(n-9) with a(0) = ... = a(8) = 0, a(9) = 1.at n=24A122265
- a(n) = ChebyshevT(3, n).at n=16A144129
- a(n) = (n+3)^2*n/2 + 1.at n=30A154560
- a(n) = 961*n - 1.at n=16A158412
- If an array is made of columns of -nacci sequences, fibo-, tribo- etc. all starting w. 1,1,2 etc, the NW to SE diagonals can be extended by computation. The above is diagonal 7. See A159741 for details.at n=8A159743
- a(n) + a(n+2) = n^3.at n=32A206481
- Riordan array ((1-x)/(1-2*x-x^2), x*(1+x)/(1-2*x-x^2)).at n=48A210636
- a(n) = n^3 - a(n-2) for n >= 2 and a(0)=0, a(1)=1.at n=31A215097
- Number of nX2 arrays of occupancy after each element moves to some king-move neighbor, without 2-loops.at n=4A221103
- T(n,k)=Number of nXk arrays of occupancy after each element moves to some king-move neighbor, without 2-loops.at n=16A221106
- T(n,k)=Number of nXk arrays of occupancy after each element moves to some king-move neighbor, without 2-loops.at n=19A221106
- Positions of 3's in A234323.at n=34A234804
- a(n) = 8*n^2 + 3*n + 1.at n=45A236267
- Partial sums of A255745.at n=18A255766
- Expansion of the g.f. (x^2-x+1)*(x^2-3*x+3)/(x-1)^6.at n=15A257890
- 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 105", based on the 5-celled von Neumann neighborhood.at n=13A278859