Number of the day: 8951

Évariste Galois was born on this day 206 years ago.

Properties of the number 8951:

8951 is a cyclic number.
8951 is the 1113^th prime.
8951 has 19 antidivisors and 8950 totatives.
8951 has a prime digit sum 23 in base 10.
Reversing the decimal digits of 8951 results in a sphenic number.
8951 = 4476² - 4475² is the difference of 2 nonnegative squares in 1 way.
8951 is the difference of 2 positive pentagonal numbers in 1 way.
8951 is not the sum of 3 positive squares.
8951² is the sum of 3 positive squares.
8951 is a proper divisor of 3²⁵ - 1.
8951 is an emirp in (at least) the following bases: 2, 3, 5, 9, 11, 12, 18, 20, 21, 25, 31, 34, 39, 41, 52, 59, 68, 70, 74, 75, 76, 80, 81, 82, 89, 92, 93, 94, 95, 97, and 100.
8951 is palindromic in (at least) the following bases: 33, 42, 57, and -22.
8951 in base 28 = bbj and consists of only the digits 'b' and 'j'.
8951 in base 31 = 99n and consists of only the digits '9' and 'n'.
8951 in base 32 = 8nn and consists of only the digits '8' and 'n'.
8951 in base 33 = 878 and consists of only the digits '7' and '8'.
8951 in base 41 = 5DD and consists of only the digits '5' and 'D'.
8951 in base 42 = 535 and consists of only the digits '3' and '5'.
8951 in base 54 = 33f and consists of only the digits '3' and 'f'.
8951 in base 56 = 2ll and consists of only the digits '2' and 'l'.
8951 in base 57 = 2h2 and consists of only the digits '2' and 'h'.

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

Sequence numbers and descriptions below are taken from OEIS.
A052283: Triangle read by rows giving numbers of directed graphs by numbers of nodes and arcs.
A060528: A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to the ratios of two tones of musical harmony: the perfect 4th, 4/3 and its complement the perfect 5th, 3/2.
A129733: List of primitive prime divisors of the numbers (3^n-1)/2 (A003462) in their order of occurrence.
A142027: Primes congruent to 23 mod 31.
A165459: Primes p such that the sum of the digits of p^2 is 16.
A189560: Least odd number k such that x' = k has n solutions, where x' is the arithmetic derivative (A003415) of x.
A196202: a(n) = 2^(prime(n)-1) mod prime(n)^2.
A237811: Primes p such that 2*p+1 and 2*p+9 are also prime.
A246342: a(0) = 12, after which, if a(n-1) = product_{k >= 1} (p_k)^(c_k), then a(n) = (1/2) * (1 + product_{k >= 1} (p_{k+1})^(c_k)), where p_k indicates the k-th prime, A000040(k).
A265786: Numerators of upper primes-only best approximates (POBAs) to sqrt(5); see Comments.