Number of the day: 13422

Alexander Grothendieck was born on this day 93 years ago.

Properties of the number 13422:

13422 = 2 × 3 × 2237 is a sphenic number and squarefree.
13422 has 3 distinct prime factors, 8 divisors, 19 antidivisors and 4472 totatives.
13422 has an oblong digit sum 12 in base 10.
Reversing the decimal digits of 13422 results in a semiprime.
13422 is the sum of 2 positive triangular numbers.
13422 is the difference of 2 positive pentagonal numbers in 2 ways.
13422 = 1² + 14² + 115² is the sum of 3 positive squares.
13422² = 6072² + 11970² is the sum of 2 positive squares in 1 way.
13422² is the sum of 3 positive squares.
13422 is a proper divisor of 1021⁴ - 1.
13422 = '134' + '22' is the concatenation of 2 semiprime numbers.
13422 is palindromic in (at least) the following bases: 63, -25, -32, and -71.
13422 in base 62 = 3UU and consists of only the digits '3' and 'U'.

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

Sequence numbers and descriptions below are taken from OEIS.
A057534: a(n+1) = a(n)/2 if 2|a(n), a(n)/3 if 3|a(n), a(n)/5 if 5|a(n), a(n)/7 if 7|a(n), a(n)/11 if 11|a(n), a(n)/13 if 13|a(n), otherwise 17*a(n)+1.
A059466: Numbers which are the sum of their proper divisors containing the digit 7.
A090744: Consider numbers of the form ...53197531975319753, whose digits read from the right are 3,5,7,9,1,3,5,7,9,1,3,... Sequence gives lengths of these numbers that are primes.
A152232: Similar to A072921 but starting with 3.
A200774: Number of nX5 0..2 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other
A200777: T(n,k)=Number of nXk 0..2 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other
A211749: Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two, four, six or eight distinct values for every i,j,k<=n
A227953: Smallest m such that A070965(m) = n.
A228963: Smallest sets of 6 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed.
A329665: Number of meanders of length n with Motzkin-steps avoiding the consecutive steps UD, HH and DU.