16416
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 48
- Divisor Sum
- 50400
- Proper Divisor Sum (Aliquot Sum)
- 33984
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5184
- Möbius Function
- 0
- Radical
- 114
- Omega Function (Ω)
- 9
- 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
- yes
- 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
- a(n) = 10*n^3 - 6*n^2.at n=12A006592
- Integer part of ((4th elementary symmetric function of 1,2,..,n)/(2nd elementary symmetric function of 1,2,...,n)).at n=29A024173
- Least term in period of continued fraction for sqrt(n) is 8.at n=36A031432
- a(n) = floor( n(n+1)(n+2)(n+3)(n+4) / (n+(n+1)+(n+2)+(n+3)+(n+4)) ).at n=15A032768
- Integer quotients of n(n + 1)(n + 2)(n + 3)(n + 4) / (n+(n+1)+(n+2)+(n+3)+(n+4)).at n=12A032770
- Number of partitions of n with equal number of parts congruent to each of 0, 3 and 4 (mod 5).at n=54A035577
- Number of subsequences of {1..n} such that all differences of pairs of terms are distinct (i.e., number of Golomb rulers on {1..n}).at n=22A054578
- Numbers k that can be expressed as k = w + x = y*z with w*x = y^3 + z^3 where w, x, y, and z are all positive integers.at n=30A057372
- a(n) = 2*n*(2*n^2 + 1).at n=16A061804
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,15.at n=33A064244
- Number of ternary squarefree necklaces.at n=36A066297
- Determinant of the n X n matrix whose element (i,j) equals the |i-j|-th composite number, or 0 if i=j.at n=5A071081
- Row sums of triangle A074135.at n=31A074132
- Sum of terms in each group in A074147.at n=31A074149
- Numbers n such that there are at least 3 integers k from the set {2,3,4,5,6,7,8,9} such that the digital sum of each base k representation of n equals k.at n=50A075761
- Sums of members of groups in A076063.at n=31A076066
- Numbers n which when converted to base 7, reversed and converted back to base 10 yield a number m such that n mod m = 0. Cases which are trivial or result in digit loss are excluded.at n=7A091081
- a(n) = n^2*(n^3+1)/2.at n=8A101378
- Matrix logarithm of A008459 (squared entries of Pascal's triangle), read by rows.at n=22A101980
- a(n) = (2n)^(2n) - (2n-1)!*(3n)!/((n-1)!*(2n)!).at n=2A111682