Saturday, December 9, 2017

Number of the day: 4815

Properties of the number 4815:

4815 = 32 × 5 × 107 is the 4166th composite number and is not squarefree.
4815 has 3 distinct prime factors, 12 divisors, 11 antidivisors and 2544 totatives.
4815 = 292 + … + 332 is the sum of at least 2 consecutive positive squares in 1 way.
4815 = 73 + 123 + 143 is the sum of 3 positive cubes in 1 way.
4815 = 24082 - 24072 = 8042 - 8012 = 4842 - 4792 = 2722 - 2632 = 1682 - 1532 = 762 - 312 is the difference of 2 nonnegative squares in 6 ways.
4815 is the difference of 2 positive pentagonal numbers in 1 way.
4815 is not the sum of 3 positive squares.
48152 = 28892 + 38522 is the sum of 2 positive squares in 1 way.
48152 is the sum of 3 positive squares.
4815 is a proper divisor of 6416 - 1.
4815 = '4' + '815' is the concatenation of 2 semiprime numbers.
4815 is palindromic in (at least) the following bases: 6, 58, and -83.
4815 in base 24 = 88f and consists of only the digits '8' and 'f'.
4815 in base 57 = 1RR and consists of only the digits '1' and 'R'.
4815 in base 58 = 1P1 and consists of only the digits '1' and 'P'.

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

Sequence numbers and descriptions below are taken from OEIS.
A001522: Number of n-stacks with strictly receding walls, or planar partitions of n.
A027578: Sums of five consecutive squares: a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2 + (n+4)^2.
A051865: 13-gonal (or tridecagonal) numbers: a(n) = n*(11*n - 9)/2.
A090669: Numbers n such that 7^n - 2 is a prime.
A121035: Multiples of 15 containing a 15 in their decimal representation.
A131246: Row sums of triangle A131245.
A226514: Column 3 of array in A226513.
A238128: Triangle read by rows: T(n,k) gives the number of ballot sequences of length n having largest descent k, n>=0, 0<=k<=n.
A257211: Numbers n such that the decimal expansions of both n and n^2 have 1 as smallest digit and 8 as largest digit.
A275172: Positions of 3 in A274640.

No comments:

Post a Comment