### Properties of the number 5463:

5463 = 3^{2}× 607 is the 4741

^{th}composite number and is not squarefree.

5463 has 2 distinct prime factors, 6 divisors, 19 antidivisors and 3636 totatives.

5463 = 2732

^{2}- 2731

^{2}= 912

^{2}- 909

^{2}= 308

^{2}- 299

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

5463 is the sum of 2 positive triangular numbers.

5463 is the difference of 2 positive pentagonal numbers in 1 way.

5463 is the difference of 2 positive pentagonal pyramidal numbers in 1 way.

5463 is not the sum of 3 positive squares.

5463

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

5463 is a divisor of 211

^{6}- 1.

5463 = '5' + '463' is the concatenation of 2 prime numbers.

5463 is palindromic in (at least) the following bases: 39, 42, 43, -2, and -52.

5463 in base 4 = 1111113 and consists of only the digits '1' and '3'.

5463 in base 20 = dd3 and consists of only the digits '3' and 'd'.

5463 in base 38 = 3TT and consists of only the digits '3' and 'T'.

5463 in base 39 = 3N3 and consists of only the digits '3' and 'N'.

5463 in base 41 = 3AA and consists of only the digits '3' and 'A'.

5463 in base 42 = 343 and consists of only the digits '3' and '4'.

5463 in base 43 = 2f2 and consists of only the digits '2' and 'f'.

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

Sequence numbers and descriptions below are taken from OEIS.A003294: Numbers n such that n^4 can be written as a sum of four positive 4th powers.

A023105: Number of distinct quadratic residues mod 2^n.

A090832: Numbers n such that p(n), p(n)+6, p(n)+12, p(n)+18 are consecutive primes, where p(n) denotes n-th prime.

A090838: Numbers n such that p(n),p(n)+6,p(n)+12,p(n)+18 are consecutive primes and p(n)=6*k+1 for some k, where p(n) denotes n-th prime.

A116459: Numbers n such that the minimal length of the corresponding shortest addition chain A003313(n)=A003313(3*n).

A140966: (5+(-2)^n)/3.

A159288: Expansion of (1+x+x^2)/(1-x^2-2*x^3).

A167053: a(1)=3, else a(n)=1+a(n-1)+gcd( a(n-1)*(a(n-1)+2), A073829(a(n-1)) ).

A246065: a(n) = sum_{k=0..n}C(n,k)^2*C(2k,k)/(2k-1), where C(n,k) denotes the binomial coefficient n!/(k!*(n-k)!).

A247608: a(n) = Sum_{k=0..3} binomial(6,k)*binomial(n,k).

## No comments:

## Post a Comment