### Properties of the number 4230:

4230 = 2 × 3^{2}× 5 × 47 is the 3650

^{th}composite number and is not squarefree.

4230 has 4 distinct prime factors, 24 divisors, 13 antidivisors and 1104 totatives.

4230 has a semiprime digit sum 9 in base 10.

4230 = 31

^{2}+ … + 34

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

4230 is the sum of 2 positive triangular numbers.

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

4230 = 1

^{2}+ 2

^{2}+ 65

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

4230

^{2}= 2538

^{2}+ 3384

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

4230

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

4230 is a divisor of 1223

^{4}- 1.

4230 = '42' + '30' is the concatenation of 2 sphenic numbers.

4230 = '42' + '30' is the concatenation of 2 oblong numbers.

4230 is palindromic in (at least) the following bases: 17, 20, 21, 89, 93, and -19.

4230 in base 17 = eae and consists of only the digits 'a' and 'e'.

4230 in base 20 = aba and consists of only the digits 'a' and 'b'.

4230 in base 21 = 9c9 and consists of only the digits '9' and 'c'.

4230 in base 26 = 66i and consists of only the digits '6' and 'i'.

4230 in base 32 = 446 and consists of only the digits '4' and '6'.

4230 in base 37 = 33C and consists of only the digits '3' and 'C'.

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

Sequence numbers and descriptions below are taken from OEIS.A000500: Number of permutations of an n-sequence discordant with three given permutations (see reference) in n-7 places.

A027575: a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2.

A054000: a(n) = 2*n^2 - 2.

A125014: Numbers n for which nontrivial positive magic squares of exactly 7 different orders with magic sum n exist. For a definition of nontrivial positive magic squares, see A125005.

A126011: A106486-encodings for the minimal representatives of each equivalence class of the finite combinatorial games.

A135191: Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=6.

A201596: Record (maximal) gaps between prime triplets (p, p+4, p+6).

A210095: T(n,k)=Number of (n+1)X(k+1) 0..2 arrays containing all values 0..2 with every 2X2 subblock having one or two distinct values, and new values 0..2 introduced in row major order

A230899: T(n,k)=Number of nXk 0..3 arrays x(i,j) with each element horizontally or vertically next to at least one element with value (x(i,j)+1) mod 4 and at least one element with value (x(i,j)-1) mod 4, no adjacent elements equal, and upper left element zero

A256753: Numbers n such that n is both the average of some twin prime pair p, q (q = p+2) (i.e., n = p+1 = q-1) and is also the average of the prime before p and the prime after q.

## No comments:

## Post a Comment