Number of the day: 74892

Jacques Philippe Marie Binet was born on this day 235 years ago.

Bartel Leendert van der Waerden was born on this day 118 years ago.

Properties of the number 74892:

74892 = 2² × 3 × 79² is the 67505^th composite number and is not squarefree.
74892 has 3 distinct prime factors, 18 divisors, 13 antidivisors and 24648 totatives.
74892 has a sphenic digit sum 30 in base 10.
74892 has an oblong digit sum 30 in base 10.
74892 has an oblong digit product 4032 in base 10.
Reversing the decimal digits of 74892 results in a semiprime.
74892 = 18724² - 18722² = 6244² - 6238² = 316² - 158² is the difference of 2 nonnegative squares in 3 ways.
74892 is the sum of 2 positive triangular numbers.
74892 is the difference of 2 positive pentagonal numbers in 1 way.
74892 = 70² + 74² + 254² is the sum of 3 positive squares.
74892² is the sum of 3 positive squares.
74892 is a proper divisor of 491²⁶ - 1.
74892 = '7489' + '2' is the concatenation of 2 prime numbers.
74892 is palindromic in (at least) the following bases: 59, 78, -80, and -97.
74892 in base 59 = LUL and consists of only the digits 'L' and 'U'.

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

Sequence numbers and descriptions below are taken from OEIS.
A142462: Triangle read by rows: T(n,k) (1<=k<=n) given by T(n, 1) = T(n,n) = 1, otherwise T(n, k) = (m*n-m*k+1)*T(n-1,k-1)+(m*k-m+1)*T(n-1,k), where m = 7.
A178455: Partial sums of floor(2^n/7).
A252431: Number of (n+2) X (6+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0, 2, 4, 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0, 2, 4, 6 or 7.
A252433: T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 4 6 or 7
A252437: Number of (4+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 4 6 or 7
A316403: Number of multisets of exactly two nonempty binary words with a total of n letters such that no word has a majority of 0's.