### Properties of the number 5080:

5080 = 2^{3}× 5 × 127 is the 4401

^{th}composite number and is not squarefree.

5080 has 3 distinct prime factors, 16 divisors, 7 antidivisors and 2016 totatives.

5080 has an emirp digit sum 13 in base 10.

5080 has a Fibonacci digit sum 13 in base 10.

5080 = 1271

^{2}- 1269

^{2}= 637

^{2}- 633

^{2}= 259

^{2}- 249

^{2}= 137

^{2}- 117

^{2}is the difference of 2 nonnegative squares in 4 ways.

5080 is the difference of 2 positive pentagonal numbers in 2 ways.

5080 = 18

^{2}+ 20

^{2}+ 66

^{2}is the sum of 3 positive squares.

5080

^{2}= 3048

^{2}+ 4064

^{2}is the sum of 2 positive squares in 1 way.

5080

^{2}is the sum of 3 positive squares.

5080 is a divisor of 509

^{2}- 1.

5080 is palindromic in (at least) the following bases: -35, and -36.

5080 in base 22 = aak and consists of only the digits 'a' and 'k'.

5080 in base 35 = 455 and consists of only the digits '4' and '5'.

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

Sequence numbers and descriptions below are taken from OEIS.A086417: Sum of divisors of 3-smooth numbers.

A100155: Structured truncated octahedral numbers.

A104494: Positive integers n such that n^17 + 1 is semiprime (A001358).

A173723: Number of symmetry classes of 3x3 semimagic squares with distinct positive values < n.

A175926: Sum of divisors of cubes.

A177011: Define two triangular arrays by: B(0,0)=C(0,0)=1, B(0,r)=C(0,r)=0 for r>0, C(t,-1)=C(t,0); and for t,r >= 0, B(t+1,r)=C(t,r-1)+2C(t,r)-B(t,r), C(t+1,r)=B(t+1,r)+2B(t+1,r+1)-C(t,r). Sequence gives array B(t,r) read by rows.

A189449: T(n,k)=Number of nXk array permutations with each element moving zero or one space horizontally or diagonally

A239056: Sum of the parts in the partitions of 4n into 4 parts with smallest part = 1.

A256708: Numbers n such that the decimal expansions of both n and n^2 have 0 as smallest digit and 8 as largest digit.

A264643: T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with rows nondecreasing modulo 3 and columns nondecreasing modulo 4.

## No comments:

## Post a Comment