16496
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 31992
- Proper Divisor Sum (Aliquot Sum)
- 15496
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8240
- Möbius Function
- 0
- Radical
- 2062
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 40
- 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
- Expansion of g.f. 1/((1-4*x)*(1-10*x)).at n=4A016157
- Dirichlet convolution of b_n=2^(n-1) with sigma(n).at n=14A034737
- Structured octagonal anti-diamond numbers (vertex structure 7).at n=15A100187
- Number of zero trace primitive elements in Galois field GF(2^n).at n=15A192211
- Number of cyclotomic cosets of 9 mod 10^n.at n=32A220020
- Number of n X 3 0..3 arrays x(i,j) with each element horizontally, vertically or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, and upper left element zero.at n=3A230836
- Number of n X 4 0..3 arrays x(i,j) with each element horizontally, vertically or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, and upper left element zero.at n=2A230837
- T(n,k)=Number of nXk 0..3 arrays x(i,j) with each element horizontally, vertically or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, and upper left element zero.at n=17A230840
- T(n,k)=Number of nXk 0..3 arrays x(i,j) with each element horizontally, vertically or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, and upper left element zero.at n=18A230840
- G.f.: Product_{n>=1} 1/(1 - x^n/n^3) = Sum_{n>=0} a(n)*x^n/n!^3.at n=4A249593
- a(n) = A001235(n) - floor(A001235(n)^(1/3))^3.at n=44A273555
- a(n) is the number of permutations of length n that avoid the pattern 321 and the mesh pattern (12, 275) or the same sequence for the mesh patterns (12, 281), (12, 305), (12, 401).at n=10A289606
- a(n) = A289670(n)/2^f(n), where f(n) = 2*floor((n-1)/3) + ((n+2) mod 3).at n=45A289676
- Trajectory of 48 under the map x -> A289667(x).at n=10A290350
- a(n) = A289676(3*n+1).at n=15A290436
- Numbers of the form x^4 + y*x^3 + y^2*x^2 + y^3*x + y^4, where x and y are positive integers.at n=42A299505
- a(n) = p(1,n), where p(x,n) is the strong divisibility sequence of polynomials based on sqrt(5) as in A327322.at n=4A329012
- Number of even-length strict integer partitions of 2n+1.at n=35A343942
- Number of strict odd-length integer partitions of 2n + 1.at n=35A346634
- a(n) = (1/2) * Sum_{d|n} (2*d)^(n/d).at n=13A359733