17600
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 42
- Divisor Sum
- 47244
- Proper Divisor Sum (Aliquot Sum)
- 29644
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6400
- Möbius Function
- 0
- Radical
- 110
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 97
- 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) = Sum_{k=1..n-1} k^3*sigma(k)*sigma(n-k).at n=7A000499
- Coordination sequence for Ni2In, Position Ni2.at n=40A009942
- Number of partitions in parts not of the form 11k, 11k+1 or 11k-1. Also number of partitions with no part of size 1 and differences between parts at distance 4 are greater than 1.at n=50A035944
- Number of triangles in an n X n grid (or geoplane).at n=6A045996
- A convolution triangle of numbers generalizing Pascal's triangle A007318.at n=62A049325
- a(n+1) = sum{j = 0,...n}[C(2n,2j)a(j)a(n-j)] with a(0) = 1.at n=6A063902
- Even numbers n such that 37^2 (the square of the first irregular prime) divides the numerator of Bernoulli(n).at n=32A090789
- Numbers k such that 6*k+1, 6*k+7, 6*k+13, 6*k+19 are consecutive primes.at n=19A090839
- Total number of smallest parts in all partitions of n into odd parts.at n=45A092268
- Expansion of 1/((1-x)^2*(1-x^2)^2*(1-x^3)).at n=43A097701
- If a(n-1)=abcde..., where a,b,c,d,e... are the digits, then a(n)=abcde...+a*bcde...+ab*cde...+abc*de...+abcd*e...+....at n=9A108721
- Triangle read by rows: T(n,k) is the number of k-cell columns in all directed column-convex polyominoes of area n (1<=k<=n).at n=56A121468
- a(n) is the self-convolution series of the sum of 5th powers of the first n natural numbers.at n=3A145218
- a(n) = 16^n * Sum_{k=0..n} binomial(2*k,k)^3 / 16^k.at n=3A167870
- a(1)=1. a(n+1) = Sum_{k=1..n} a(b(k,n)), where b(k,n) is the largest positive integer that, when written in binary, occurs as a substring in both binary k and binary n.at n=43A175491
- Numbers with 42 divisors.at n=14A175750
- Numbers of the form p^6*q^2*r where p, q, and r are distinct primes.at n=13A179703
- Square array read by antidiagonals downwards: T(n,k) = number of ways to arrange k indistinguishable points on an n X n square grid so that no three points are collinear at any angle.at n=42A194193
- Number of (n+2) X 4 binary arrays avoiding patterns 001 and 101 in rows and columns.at n=7A202196
- T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 101 in rows and columns.at n=37A202202