Number of the day: 5889

Properties of the number 5889:

5889 = 3 × 13 × 151 is a sphenic number and squarefree.
5889 has 3 distinct prime factors, 8 divisors, 7 antidivisors and 3600 totatives.
5889 has a sphenic digit sum 30 in base 10.
5889 has an oblong digit sum 30 in base 10.
Reversing the decimal digits of 5889 results in a sphenic number.
5889 = 2945² - 2944² = 983² - 980² = 233² - 220² = 95² - 56² is the difference of 2 nonnegative squares in 4 ways.
5889 is the sum of 2 positive triangular numbers.
5889 is the difference of 2 positive pentagonal numbers in 2 ways.
5889 = 7² + 8² + 76² is the sum of 3 positive squares.
5889² = 2265² + 5436² is the sum of 2 positive squares in 1 way.
5889² is the sum of 3 positive squares.
5889 is a proper divisor of 1693³ - 1.
5889 is palindromic in (at least) the following bases: 64, -54, and -92.
5889 in base 11 = 4474 and consists of only the digits '4' and '7'.
5889 in base 20 = ee9 and consists of only the digits '9' and 'e'.

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

Sequence numbers and descriptions below are taken from OEIS.
A005919: Number of points on surface of tricapped prism: 7n^2 + 2 for n>0.
A046256: a(1) = 6; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.
A046259: a(1) = 9; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.
A051892: Values of e, the lesser key or generating number for Pythagorean triangles in which S (the odd short leg) and U (the hypotenuse) are twin primes.
A098326: Recurrence derived from the decimal places of sqrt(2). a(0)=0, a(i+1)=position of first occurrence of a(i) in decimal places of sqrt(2).
A124619: Odd interprimes divisible by 13.
A128780: Numbers n such that n^k+(n+1)^k is prime for k = 1, 2, 4.
A158231: a(n) = 256*n + 1.
A246381: Triangular matrix T defined by T = exp(L) where L(n,k) = C(2*n, 2*k+1)/2, as read by rows n>=0, k=0..n.
A246382: Column 0 of triangular matrix A246381 = exp(L) where L(n,k) = C(2*n, 2*k+1)/2.