16832
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 14
- Divisor Sum
- 33528
- Proper Divisor Sum (Aliquot Sum)
- 16696
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8384
- Möbius Function
- 0
- Radical
- 526
- Omega Function (Ω)
- 7
- 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
- 84
- 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
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite RON = Roggianite Ca16[Be8Al16Si32O104(OH)16].19H2O starting with a T4 atom.at n=16A019216
- Expansion of (theta_3(z)*theta_3(7z) + theta_2(z)*theta_2(7z))^4.at n=15A028596
- a(n) = a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p<n-1<=2^(p+1), for n >= 4.at n=30A050071
- Number of base 28 n-digit numbers with adjacent digits differing by four or less.at n=4A126523
- Numbers of unstrained alkane staggered conformers (acyclic). See Table 4 of Cyvin et al. reference for precise definition.at n=7A126878
- 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, 0), (0, -1, 1), (0, 0, 1), (0, 1, -1), (1, 0, 0)}.at n=8A150102
- Numbers m such that m^2 + 3^k is prime for k = 1, 2, 3.at n=26A177173
- Triangle T(n,m) of the coefficients JacobiNC(x,y) = sum_{n>0} sum_{m=0..n-1} (-1)^m* T(n,m) *x^(2*n) *y^(2*m)/(2*n)!.at n=13A181613
- Triangular array: the fission of ((x+2)^n) by (q(n,x)) given by q(n,x)=x^n+x^(n-1)+...+x+1.at n=40A193850
- Mirror of the triangle A193850.at n=40A193851
- a(n) = 2^(n-4)*(4*n^2 - 16*n + 23).at n=6A217529
- Numbers of the form 5^j + 7^k, for j and k >= 0.at n=36A226818
- Number of partitions p of n such that max(p) - min(p) is a part of p.at n=44A238493
- Real part of Q^n, where Q is the quaternion 2 + j + k.at n=11A266046
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 294", based on the 5-celled von Neumann neighborhood.at n=45A271134
- Array read by antidiagonals: T(m,n) = number of Eulerian cycles in the torus grid graph C_m X C_n.at n=16A298117
- Array read by antidiagonals: T(m,n) = number of Eulerian cycles in the torus grid graph C_m X C_n.at n=19A298117
- Number of Eulerian cycles in the graph Cartesian product of C_n and a double edge.at n=4A298198
- Number of partitions of n with seven parts in which no part occurs more than twice.at n=44A320595
- Expansion of Sum_{k>=0} (x * (2 + x^k))^k.at n=14A360771