Sunday, November 22, 2020

Number of the day: 34443

Émile Michel Hyacinthe Lemoine was born on this day 180 years ago.

Properties of the number 34443:

34443 = 32 × 43 × 89 is the 30763th composite number and is not squarefree.
34443 has 3 distinct prime factors, 12 divisors, 23 antidivisors and 22176 totatives.
34443 = 172222 - 172212 = 57422 - 57392 = 19182 - 19092 = 4222 - 3792 = 2382 - 1492 = 1982 - 692 is the difference of 2 nonnegative squares in 6 ways.
34443 is the difference of 2 positive pentagonal numbers in 1 way.
34443 = 72 + 132 + 1852 is the sum of 3 positive squares.
344432 = 150932 + 309602 is the sum of 2 positive squares in 1 way.
344432 is the sum of 3 positive squares.
34443 is a proper divisor of 1796 - 1.
34443 is a palindrome (in base 10).
34443 is palindromic in (at least) base -36.
34443 consists of only the digits '3' and '4'.
34443 in base 40 = LL3 and consists of only the digits '3' and 'L'.
34443 in base 41 = KK3 and consists of only the digits '3' and 'K'.

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

Sequence numbers and descriptions below are taken from OEIS.
A006341: Octal palindromes which are also primes.
A041657: Denominators of continued fraction convergents to sqrt(347).
A077291: Second member of Diophantine pair (m,k) that satisfies 6*(m^2 + m) = k^2 + k: a(n) = k.
A077741: Smallest multiple of n which begins with R(n) and ends in n where R(n) (A004086) is the digit reversal of n. Suitable number of zeros are assumed to the left of the MSD if required.
A082394: Let p = n-th prime of the form 4k+3, take the solution (x,y) to the Pellian equation x^2 - p*y^2 = 1 with x and smallest y >= 1; sequence gives value of y.
A084008: a(n) = T(n) concatenated with reverse(T(n)) divided by 11, where T(n) is the n-th triangular number.
A094625: Expansion of x*(2+22*x+11*x^2)/((x-1)*(1+x)*(10*x^2-1)).
A095294: Number of A095284-primes in range ]2^n,2^(n+1)].
A096025: Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 6 and (n+7) mod 9 <> 1.
A175760: Numbers n such that d(n + d(n)) = d(n), where d(n) is the sum of the distinct primes dividing n.

No comments:

Post a Comment