16392
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
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 41040
- Proper Divisor Sum (Aliquot Sum)
- 24648
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5456
- Möbius Function
- 0
- Radical
- 4098
- Omega Function (Ω)
- 5
- 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
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 32.at n=7A031710
- Numbers k such that neither 4 nor 9 divides binomial(2k-1,k) (almost certainly finite).at n=27A051404
- Numbers k such that k | sigma_11(k).at n=33A055715
- Number of ways of 4-coloring a map in which there is a central circle surrounded by an annulus divided into n-1 regions. There are n regions in all.at n=9A090860
- Lower triangular matrix T, read by rows, that shifts left one column under the matrix square of T, with T(n,0)=T(n,1) for n>0 and T(n,n)=1 for n>=0.at n=31A098539
- Column 3 of triangle A098539, which shifts columns left and up under matrix square.at n=4A111812
- Triangle T(n,k) defined by: T(0,0)=1, T(n,k)=0 if k < 0 or k > n, T(n,k) = T(n-1,k-1) + k*T(n-1,k) + Sum_{j>=1} T(n-1,k+j).at n=47A116155
- a(0) = 3; for n >= 1, if a(n-1) = 2*k, then a(n) = k, otherwise 1 + (A065091(n)*a(n-1)), where A065091(n) gives the n-th odd prime.at n=11A140948
- Number of additive cyclic codes over GF(4) of length n that can be generated by one codeword.at n=12A143696
- Triangle, read by rows, T(n, k) = binomial(n, k) for n < 2 and binomial(n, k) + 4^(n-1) * binomial(n-2, k-1) otherwise.at n=37A146988
- Triangle, read by rows, T(n, k) = binomial(n, k) for n < 2 and binomial(n, k) + 4^(n-1) * binomial(n-2, k-1) otherwise.at n=43A146988
- a(n) = 64*n^2 + 8.at n=15A158488
- Triangle T(n, k) = f(k, n-k+1) + f(n-k+1, k), where f(n, k) = round( ((1+sqrt(k))^(2*n+1) - (1-sqrt(k))^(2*n+1))/(2*sqrt(k))) - 1, read by rows.at n=21A173568
- Triangle T(n, k) = f(k, n-k+1) + f(n-k+1, k), where f(n, k) = round( ((1+sqrt(k))^(2*n+1) - (1-sqrt(k))^(2*n+1))/(2*sqrt(k))) - 1, read by rows.at n=27A173568
- a(n) = 8*(2^n + 1).at n=11A175161
- Irregular triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k isolated fixed points.at n=23A184178
- Number of conjugacy classes in Chevalley group G_2(q) as q runs through the prime powers.at n=42A225929
- Numbers of the form 4^j + 8^k, for j and k >= 0.at n=33A226822
- a(n) = 2^n + 8.at n=14A242475
- The 360 degree spoke (or ray) of a hexagonal spiral of Ulam.at n=37A244803