Number of the day: 9757

Shiing-Shen Chern was born on this day 107 years ago.

Properties of the number 9757:

9757 is a cyclic number.
9757 = 11 × 887 is semiprime and squarefree.
9757 has 2 distinct prime factors, 4 divisors, 15 antidivisors and 8860 totatives.
9757 has a triangular digit sum 28 in base 10.
Reversing the decimal digits of 9757 results in a sphenic number.
9757 = 12³ + 13³ + 18³ is the sum of 3 positive cubes in 1 way.
9757 = 4879² - 4878² = 449² - 438² is the difference of 2 nonnegative squares in 2 ways.
9757 is the difference of 2 positive pentagonal numbers in 2 ways.
9757 = 10² + 21² + 96² is the sum of 3 positive squares.
9757² is the sum of 3 positive squares.
9757 is a proper divisor of 353⁴⁴³ - 1.
9757 is an emirpimes in (at least) the following bases: 5, 12, 13, 14, 16, 18, 20, 21, 23, 25, 31, 37, 40, 41, 42, 43, 44, 45, 47, 51, 57, 63, 64, 67, 71, 73, 75, 77, 79, 80, 83, 84, 89, 90, 96, 98, and 99.
9757 is palindromic in (at least) the following bases: 9, -28, -39, and -46.
9757 in base 3 = 111101101 and consists of only the digits '0' and '1'.
9757 in base 25 = ff7 and consists of only the digits '7' and 'f'.
9757 in base 27 = daa and consists of only the digits 'a' and 'd'.
9757 in base 28 = ccd and consists of only the digits 'c' and 'd'.

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

Sequence numbers and descriptions below are taken from OEIS.
A050069: a(n) = a(n-1)+a(m), where m=2^(p+1)+2-n and 2^p<n-1<=2^(p+1), for n >= 4.
A056434: Number of step cyclic shifted sequence structures using exactly two different symbols.
A084476: Least k such that 10^(2n-1)+k is a brilliant number.
A136780: Number of primitive multiplex juggling sequences of length n, base state <1,1,1> and hand capacity 2.
A192160: Monotonic ordering of nonnegative differences 10^i-3^j, for i>=0, j>=0.
A228930: Optimal ascending continued fraction expansion of e - 2.
A258167: Indices of the start of 9 successive distinct digits in the decimal expansion of e (2.718281828...).
A268306: The number of even permutations p of 1,2,...,n such that -1<=p(i)-i<=2 for i=1,2,...,n
A290100: Start from the singleton set S = {n}, and unless 1 is already a member of S, generate on each iteration a new set where each odd number k is replaced by 3k+1, and each even number k is replaced by 3k+1 and k/2. a(n) is the size of the set after the first iteration which has produced 1 as a member.
A316719: Expansion of Product_{k=1..7} (1+x^(2*k-1))/(1-x^(2*k)).