Thursday, November 12, 2020

Number of the day: 9695

Floris Takens was born on this day 80 years ago.

Properties of the number 9695:

9695 is a cyclic number.
9695 = 5 × 7 × 277 is a sphenic number and squarefree.
9695 has 3 distinct prime factors, 8 divisors, 13 antidivisors and 6624 totatives.
9695 has a prime digit sum 29 in base 10.
Reversing the decimal digits of 9695 results in a semiprime.
9695 = (30 × 31)/2 + … + (43 × 44)/2 is the sum of at least 2 consecutive triangular numbers in 1 way.
9695 = 48482 - 48472 = 9722 - 9672 = 6962 - 6892 = 1562 - 1212 is the difference of 2 nonnegative squares in 4 ways.
9695 is the difference of 2 positive pentagonal numbers in 4 ways.
9695 is not the sum of 3 positive squares.
96952 = 58172 + 77562 = 20722 + 94712 = 46412 + 85122 = 40252 + 88202 is the sum of 2 positive squares in 4 ways.
96952 is the sum of 3 positive squares.
9695 is a proper divisor of 9913 - 1.
9695 = '9' + '695' is the concatenation of 2 semiprime numbers.
9695 is palindromic in (at least) base 74.

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

Sequence numbers and descriptions below are taken from OEIS.
A006477: Number of partitions of n with at least 1 odd and 1 even part.
A035622: Number of partitions of n into parts 4k and 4k+2 with at least one part of each type.
A047967: Number of partitions of n with some part repeated.
A055831: T(n,n-4), where T is the array in A055830.
A065903: Integers i > 1 for which there is no prime p such that i is a solution mod p of x^4 = 2.
A072895: Least k for the Theodorus spiral to complete n revolutions.
A139273: a(n) = n*(8*n - 3).
A143328: Table T(n,k) read by antidiagonals. T(n,k) is the number of primitive (=aperiodic) k-ary Lyndon words (n,k >= 1) with length less than or equal to n.
A212685: Number of (w,x,y,z) with all terms in {1,...,n} and |w-x|=w+|y-z|.
A215474: Triangle read by rows: number of k-ary n-tuples (a_1,..,a_n) such that the string a_1...a_n is preprime.

No comments:

Post a Comment