### Properties of the number 4675:

4675 = 5^{2}× 11 × 17 is the 4042

^{th}composite number and is not squarefree.

4675 has 3 distinct prime factors, 12 divisors, 15 antidivisors and 3200 totatives.

4675 has a semiprime digit sum 22 in base 10.

4675 = 2338

^{2}- 2337

^{2}= 470

^{2}- 465

^{2}= 218

^{2}- 207

^{2}= 146

^{2}- 129

^{2}= 106

^{2}- 81

^{2}= 70

^{2}- 15

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

4675 is the sum of 2 positive triangular numbers.

4675 is the difference of 2 positive pentagonal numbers in 6 ways.

4675 = 9

^{2}+ 25

^{2}+ 63

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

4675

^{2}= 2200

^{2}+ 4125

^{2}= 715

^{2}+ 4620

^{2}= 1980

^{2}+ 4235

^{2}= 3267

^{2}+ 3344

^{2}= 957

^{2}+ 4576

^{2}= 2805

^{2}+ 3740

^{2}= 1309

^{2}+ 4488

^{2}is the sum of 2 positive squares in 7 ways.

4675

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

4675 is a divisor of 307

^{4}- 1.

4675 = '467' + '5' is the concatenation of 2 prime numbers.

4675 is palindromic in (at least) the following bases: 57, 84, -29, and -82.

4675 in base 30 = 55p and consists of only the digits '5' and 'p'.

4675 in base 56 = 1RR and consists of only the digits '1' and 'R'.

4675 in base 57 = 1P1 and consists of only the digits '1' and 'P'.

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

Sequence numbers and descriptions below are taken from OEIS.A051798: a(n) = (n+1)*(n+2)*(n+3)*(9n+4)/24.

A091635: Number of primes less than 10^n which do not contain the digit 1.

A129995: a(n) = (n + 1)*(n^2 + 2)*(n^3 + 3)*(n^4 + 4)/4!.

A143127: Sum of k*d(k) over k=1,2,...,n, where d(k) is the number of divisors of k.

A157405: A partition product of Stirling_2 type [parameter k = 5] with biggest-part statistic (triangle read by rows).

A216995: Multiples of 11 such that the digit sum is a multiple of 11.

A217088: Numbers n such that (n^89-1)/(n-1) is prime.

A217844: Numbers which are the sums of consecutive fourth powers.

A228413: Count of the first 10^n primes which do not contain the digit 1.

A237823: Number of partitions of n such that (greatest part) + (least part) <= number of parts.

## No comments:

## Post a Comment