Saturday, November 10, 2018

Number of the day: 5799

Properties of the number 5799:

5799 = 3 × 1933 is semiprime and squarefree.
5799 has 2 distinct prime factors, 4 divisors, 5 antidivisors and 3864 totatives.
5799 has a sphenic digit sum 30 in base 10.
5799 has an oblong digit sum 30 in base 10.
5799 = 29002 - 28992 = 9682 - 9652 is the difference of 2 nonnegative squares in 2 ways.
5799 is the sum of 2 positive triangular numbers.
5799 is the difference of 2 positive pentagonal numbers in 1 way.
5799 is not the sum of 3 positive squares.
57992 = 32762 + 47852 is the sum of 2 positive squares in 1 way.
57992 is the sum of 3 positive squares.
5799 is a proper divisor of 27712 - 1.
5799 = '579' + '9' is the concatenation of 2 semiprime numbers.
5799 is an emirpimes in (at least) the following bases: 2, 4, 11, 12, 15, 17, 23, 24, 29, 31, 33, 35, 37, 40, 41, 43, 47, 49, 51, 54, 55, 58, 60, 61, 68, 73, 77, 81, 84, 88, 90, 92, 93, 97, and 100.
5799 is palindromic in (at least) the following bases: 42, and -46.
5799 in base 5 = 141144 and consists of only the digits '1' and '4'.
5799 in base 12 = 3433 and consists of only the digits '3' and '4'.
5799 in base 21 = d33 and consists of only the digits '3' and 'd'.
5799 in base 41 = 3II and consists of only the digits '3' and 'I'.
5799 in base 42 = 3C3 and consists of only the digits '3' and 'C'.

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

Sequence numbers and descriptions below are taken from OEIS.
A000444: Partially labeled rooted trees with n nodes (3 of which are labeled).
A005821: a(n) = [ tau*a(n-1) ] + a(n-2).
A033681: a(1) = 3; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.
A094362: McKay-Thompson series of class 39C for the Monster group with a(0) = 1.
A098702: Number of self-polar configurations of type (n_3).
A107717: Triangular matrix T, read by rows, that satisfies: SHIFT_LEFT(column 0 of T^((3*p-1)/3) = (3*p-1)*(column p of T), or [T^((3*p-1)/3)](m,0) = (3*p-1)*T(p+m,p) for all m>=1 and p>=0.
A111473: a(1) = 3, a(n) = least k such that concatenation of n copies of k with all previous concatenation gives a prime.
A219519: T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 nXk array
A246569: Semiprimes with strictly increasing product of digits.
A268393: Positions of records in permutation A267107.

No comments:

Post a Comment