Number of the day: 9216

Properties of the number 9216:

9216 = 2¹⁰ × 3² is the 8073^th composite number and is not squarefree.
9216 has 2 distinct prime factors, 33 divisors, 4 antidivisors and 3072 totatives.
9216 = 96² is a perfect power.
9216 has sum of divisors equal to 26611 which is a sphenic number.
9216 = 96² is a perfect square.
9216 = 6³ + 10³ + 20³ is the sum of 3 positive cubes in 1 way.
9216 = (95 × 96)/2 + (96 × 97)/2 is the sum of at least 2 consecutive triangular numbers in 1 way. In fact, it is the sum of 2 triangular numbers.
9216 is the difference of 2 nonnegative squares in 14 ways.
9216 is the difference of 2 positive pentagonal numbers in 1 way.
9216 is the sum of 3 positive squares.
9216² is the sum of 3 positive squares.
9216 is a proper divisor of 1279⁴ - 1.
9216 = '921' + '6' is the concatenation of 2 semiprime numbers.
9216 is palindromic in (at least) the following bases: 31, 47, 95, -33, -49, and -97.
9216 in base 8 = 22000 and consists of only the digits '0' and '2'.
9216 in base 21 = kii and consists of only the digits 'i' and 'k'.
9216 in base 24 = g00 and consists of only the digits '0' and 'g'.
9216 in base 31 = 9i9 and consists of only the digits '9' and 'i'.
9216 in base 32 = 900 and consists of only the digits '0' and '9'.
9216 in base 46 = 4GG and consists of only the digits '4' and 'G'.
9216 in base 47 = 484 and consists of only the digits '4' and '8'.
9216 in base 48 = 400 and consists of only the digits '0' and '4'.

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

Sequence numbers and descriptions below are taken from OEIS.
A005010: a(n) = 9*2^n.
A005179: Smallest number with exactly n divisors.
A007416: The minimal numbers: sequence A005179 arranged in increasing order.
A033845: Numbers n of the form 2^i*3^j, i and j >= 1.
A069273: 12-almost primes (generalization of semiprimes).
A106429: Smallest number beginning with 9 and having exactly n prime divisors counted with multiplicity.
A178715: a(n) = solution to the "Select All, Copy, Paste" problem: Given the ability to type a single letter, or to type individual "Select All", "Copy" or "Paste" command key strokes, what is the maximal number of letters of text that can be obtained with n key strokes?
A244120: Triangle read by rows: coefficients T(n,k) of a binomial decomposition of n^n as Sum(k=0..n)T(n,k)*binomial(n,k).
A244124: Triangle read by rows: coefficients T(n,k) of a binomial decomposition of 2^n-1 as Sum(k=0..n)T(n,k)*binomial(n,k).
A244125: Triangle read by rows: terms T(n,k) of a binomial decomposition of 2^n-1 as Sum(k=0..n)T(n,k).