Number of the day: 31690

Properties of the number 31690:

31690 = 2 × 5 × 3169 is a sphenic number and squarefree.
31690 has 3 distinct prime factors, 8 divisors, 11 antidivisors and 12672 totatives.
31690 has a prime digit sum 19 in base 10.
31690 = (46 × 47)/2 + … + (65 × 66)/2 is the sum of at least 2 consecutive triangular numbers in 1 way.
31690 is the sum of 2 positive triangular numbers.
31690 is the difference of 2 positive pentagonal numbers in 2 ways.
31690 = 91² + 153² = 19² + 177² is the sum of 2 positive squares in 2 ways.
31690 = 81² + 100² + 123² is the sum of 3 positive squares.
31690² = 19014² + 25352² = 15128² + 27846² = 6726² + 30968² = 13200² + 28810² is the sum of 2 positive squares in 4 ways.
31690² is the sum of 3 positive squares.
31690 is a proper divisor of 79¹² - 1.
31690 is palindromic in (at least) the following bases: 55, and 62.
31690 in base 32 = uua and consists of only the digits 'a' and 'u'.
31690 in base 44 = GGA and consists of only the digits 'A' and 'G'.
31690 in base 54 = Akk and consists of only the digits 'A' and 'k'.
31690 in base 55 = AQA and consists of only the digits 'A' and 'Q'.
31690 in base 61 = 8VV and consists of only the digits '8' and 'V'.
31690 in base 62 = 8F8 and consists of only the digits '8' and 'F'.

The number 31690 belongs to the following On-Line Encyclopedia of Integer Sequences (OEIS) sequences (among others):

Sequence numbers and descriptions below are taken from OEIS.
A084569: Partial sums of A084570.
A085146: Numbers n such that n!!!!+1 is prime.
A102437: Let pi be an unrestricted partition of n with the summands written in binary notation. a(n) is the number of such partitions whose binary representation has an odd number of binary ones.
A307240: a(0) = 1; a(n) = Sum_{k=1..n} -lambda(k+1)*a(n-k), where lambda() is the Liouville function (A008836).
A338277: Greatest integer k such that its square root is less than or equal to the Sum_{j=0..n} sqrt(j).
A339068: Number of unlabeled series-reduced 2-connected graphs with n edges.