Number of the day: 11168

Johann Bernoulli was born on this day 355 years ago.

Properties of the number 11168:

11168 = 2⁵ × 349 is the 9815^th composite number and is not squarefree.
11168 has 2 distinct prime factors, 12 divisors, 9 antidivisors and 5568 totatives.
11168 has an emirp digit sum 17 in base 10.
Reversing the decimal digits of 11168 results in a prime.
11168 = 2³ + 8³ + 22³ is the sum of 3 positive cubes in 1 way.
11168 = 2793² - 2791² = 1398² - 1394² = 702² - 694² = 357² - 341² is the difference of 2 nonnegative squares in 4 ways.
11168 = 52² + 92² is the sum of 2 positive squares in 1 way.
11168 = 12² + 32² + 100² is the sum of 3 positive squares.
11168² = 5760² + 9568² is the sum of 2 positive squares in 1 way.
11168² is the sum of 3 positive squares.
11168 is a proper divisor of 911⁴ - 1.
11168 is palindromic in (at least) the following bases: 36, 55, and -25.
11168 in base 13 = 5111 and consists of only the digits '1' and '5'.
11168 in base 22 = 111e and consists of only the digits '1' and 'e'.
11168 in base 30 = cc8 and consists of only the digits '8' and 'c'.
11168 in base 36 = 8m8 and consists of only the digits '8' and 'm'.
11168 in base 54 = 3ii and consists of only the digits '3' and 'i'.
11168 in base 55 = 3c3 and consists of only the digits '3' and 'c'.

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

Sequence numbers and descriptions below are taken from OEIS.
A046994: Number of Greek-key tours on a 3 X n board; i.e., self-avoiding walks on a 3 X n grid starting in the top left corner.
A084422: Number of subsets of integers 1 through n (including the empty set) containing no pair of integers that share a common factor.
A110735: Let n = a_1a_2...a_k, where the a_i are digits. a(n) = least multiple of n of the type b_1a_1b_2a_2...a_kb_{k+1}, obtained by inserting single digits b_i in the gaps and both ends; 0 if no such number exists.
A138744: Let r_1 = 1. Let r_{m+1} = r_1 + 1/(r_2 + 1/(r_3 +...(r_{m-1} + 1/r_m)...)), a continued fraction of rational terms. Then a(n) is the sum of the (positive integer) terms in the simple continued fraction of r_n.
A164191: Number of binary strings of length n with equal numbers of 00000 and 11111 substrings
A177482: Suppose e<f, e<h, g<f and g<h. To avoid fegh means not to have four consecutive letters such that the second and the third letters are less than the first and the fourth letters.
A185098: a(n) = floor((265/6)*4^(n-4) - n^2 - ((15+(-1)^(n-1))/6)* 2^(n-3)).
A223432: T(n,k)=5X5X5 triangular graph without horizontal edges coloring a rectangular array: number of nXk 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 3,6 3,7 4,7 4,8 5,8 5,9 6,10 6,11 7,11 7,12 8,12 8,13 9,13 9,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph
A248575: Rounded sums of the non-integer cube roots of n, as partitioned by the integer roots: round[sum(j from n^3+1 to (n+1)^3-1, j^(1/3))].
A285152: T(n,k) = Number of n X k 0..1 arrays with the number of 1s horizontally or antidiagonally adjacent to some 0 one less than the number of 0's adjacent to some 1.