Number of the day: 7113

Properties of the number 7113:

7113 = 3 × 2371 is semiprime and squarefree.
7113 has 2 distinct prime factors, 4 divisors, 9 antidivisors and 4740 totatives.
7113 has an oblong digit sum 12 in base 10.
7113 has a semiprime digit product 21 in base 10.
7113 has a Fibonacci digit product 21 in base 10.
7113 has a triangular digit product 21 in base 10.
Reversing the decimal digits of 7113 results in an emirpimes.
7113 = 3557² - 3556² = 1187² - 1184² is the difference of 2 nonnegative squares in 2 ways.
7113 is the sum of 2 positive triangular numbers.
7113 is the difference of 2 positive pentagonal numbers in 1 way.
7113 = 10² + 17² + 82² is the sum of 3 positive squares.
7113² is the sum of 3 positive squares.
7113 is a proper divisor of 1907⁶ - 1.
7113 = '7' + '113' is the concatenation of 2 prime numbers.
7113 is an emirpimes in (at least) the following bases: 4, 5, 8, 9, 10, 19, 28, 36, 44, 47, 48, 51, 60, 64, 65, 69, 70, 71, 72, 73, 75, 76, 84, 89, 94, and 100.
7113 is palindromic in (at least) the following bases: 29, 45, and -34.
7113 in base 29 = 8d8 and consists of only the digits '8' and 'd'.
7113 in base 44 = 3TT and consists of only the digits '3' and 'T'.
7113 in base 45 = 3N3 and consists of only the digits '3' and 'N'.
7113 in base 59 = 22X and consists of only the digits '2' and 'X'.

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

Sequence numbers and descriptions below are taken from OEIS.
A006124: a(n) = 3 + n/2 + 7*n^2/2.
A022503: Describe the previous term! (method B - initial term is 7).
A027026: a(n) = T(n,n+4), T given by A027023.
A027032: a(n) = T(n,2n-8), T given by A027023.
A033679: a(1) = 2; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.
A152136: a(0) = 0; thereafter a(n) is always the smallest integer > a(n-1) not leading to a contradiction, such that the concatenation of any two consecutive digits in the sequence is a prime.
A152607: a(1) = 1; thereafter a(n) is always the smallest integer > a(n-1) not leading to a contradiction, such that the concatenation of any two consecutive digits in the sequence is a prime.
A239986: T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or two plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4
A249334: Numbers n for which the digital sum contains the same distinct digits as the digital product.
A249335: Numbers n for which the digital sum contains the same distinct digits as the digital product but the digital sum is not equal to the digital product.