16710
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 40176
- Proper Divisor Sum (Aliquot Sum)
- 23466
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4448
- Möbius Function
- 1
- Radical
- 16710
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 128
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- Number of nonnegative solutions to x^2 + y^2 + z^2 <= n^2.at n=31A000604
- High temperature series for spin-1/2 Ising magnetic susceptibility on 3-dimensional simple cubic lattice.at n=6A002913
- Sum of digits of n-th term in Look and Say sequence A005150.at n=32A004977
- a(0) = 1; for n>0, a(n) = (2^n-1)*a(n-1)-(-1)^n.at n=5A111491
- Infinite product of triangle A167271 columns.at n=22A167273
- Numbers k that divide the sum of digits of 21^k.at n=61A175589
- Number of 4-step one space leftwards or up, two space rightwards or down asymmetric rook's tours on an n X n board summed over all starting positions.at n=18A187299
- a(n) is conjectured to be the largest power k for which k divides the sum of digits of n^k.at n=20A220365
- G.f.: x^4*(6 + x - 7*x^2 - x^3 + 3*x^4 + x^5)/(1-x-x^2)^3.at n=14A229731
- Number of (n+2) X (n+2) 0..3 arrays with no row, column, diagonal or antidiagonal in any 3 X 3 subblock summing to 2, 3, 6, or 7.at n=2A251783
- Number of (n+2)X(3+2) 0..3 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 2 3 6 or 7.at n=2A251786
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 2 3 6 or 7.at n=12A251791
- Noncube integers n such that n^2 + 1 is the sum of 2 positive cubes.at n=11A267119
- E.g.f.: exp(10*(exp(x)-1)).at n=4A276507
- Expansion of Product_{k>=1} (1 + x^k)^A002131(k).at n=18A301798
- Number of integer partitions of n whose multiplicities all appear the same number of times.at n=48A325333
- G.f.: Sum_{n>=0} (n+1)*(n+2)/2 * (x + x^n)^n.at n=59A325998
- Number of factorizations of 2^n into factors > 1 with even integer average.at n=48A326671
- Triangle read by rows: T(n,k) is the number of configurations with exactly k polyomino matchings in a generalized game of memory played on the path of length 4n.at n=25A334057
- Number of grains of sand required to be added to one cell at the origin in an initially empty and infinite 3D cubic grid for the 3D sandpile model such that the distance from the origin of the furthest nonempty cell along the axes is n.at n=11A351783