Number of the day: 95503

Properties of the number 95503:

95503 = 43 × 2221 is semiprime and squarefree.
95503 has 2 distinct prime factors, 4 divisors, 15 antidivisors and 93240 totatives.
95503 has a semiprime digit sum 22 in base 10.
Reversing the decimal digits of 95503 results in a prime.
95503 = 47752² - 47751² = 1132² - 1089² is the difference of 2 nonnegative squares in 2 ways.
95503 is the difference of 2 positive pentagonal numbers in 2 ways.
95503 is not the sum of 3 positive squares.
95503² = 54180² + 78647² is the sum of 2 positive squares in 1 way.
95503² is the sum of 3 positive squares.
95503 is a divisor of 317⁸⁴ - 1.
95503 is an emirpimes in (at least) the following bases: 3, 5, 7, 9, 15, 16, 21, 22, 25, 26, 29, 30, 31, 33, 35, 37, 39, 41, 44, 46, 47, 50, 55, 56, 57, 61, 66, 73, 75, 81, 83, 84, 85, 89, 90, and 96.
95503 in base 51 = aaV and consists of only the digits 'V' and 'a'.
95503 in base 55 = VVN and consists of only the digits 'N' and 'V'.

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

Sequence numbers and descriptions below are taken from OEIS.
A005651: Sum of multinomial coefficients (n_1+n_2+...)!/(n_1!*n_2!*...).
A152536: Sum_{k=0..binomial(n,2)}(-1)^k*A152534(n,k).
A183610: Rectangular table where T(n,k) is the sum of the n-th powers of the k-th row of multinomial coefficients in triangle A036038 for n>=0, k>=0, as read by antidiagonals.
A226878: Number of n-length words w over a 8-ary alphabet {a1,a2,...,a8} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a8) >= 0, where #(w,x) counts the number of letters x in word w.
A226879: Number of n-length words w over a 9-ary alphabet {a1,a2,...,a9} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a9) >= 0, where #(w,x) counts the number of letters x in word w.
A226880: Number of n-length words w over a 10-ary alphabet {a1,a2,...,a10} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a10) >= 0, where #(w,x) counts the number of letters x in word w.
A261719: Number T(n,k) of partitions of n where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order and all k letters occur at least once in the partition; triangle T(n,k), n>=0, 0<=k<=n, read by rows.