Number of the day: 1150

Sophie Germain was born on this day 242 years ago.

Alexander Craig Aitken was born on this day 123 years ago.

Properties of the number 1150:

1150 = 2 × 5² × 23 is the 960^th composite number and is not squarefree.
1150 has 3 distinct prime factors, 12 divisors, 15 antidivisors and 440 totatives.
1150 has a prime digit sum 7 in base 10.
1150 is the difference of 2 positive pentagonal numbers in 3 ways.
1150 = 5² + 6² + 33² is the sum of 3 positive squares.
1150² = 690² + 920² = 322² + 1104² is the sum of 2 positive squares in 2 ways.
1150² is the sum of 3 positive squares.
1150 is a proper divisor of 599² - 1.
1150 is palindromic in (at least) the following bases: 13, 45, 49, and -28.
1150 in base 7 = 3232 and consists of only the digits '2' and '3'.
1150 in base 13 = 6a6 and consists of only the digits '6' and 'a'.
1150 in base 19 = 33a and consists of only the digits '3' and 'a'.
1150 in base 33 = 11s and consists of only the digits '1' and 's'.

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

Sequence numbers and descriptions below are taken from OEIS.
A052221: Numbers whose sum of digits is 7.
A054000: a(n) = 2*n^2 - 2.
A084646: Hypotenuses for which there exist exactly 2 distinct integer triangles.
A096173: Numbers k such that k^3+1 is an odd semiprime.
A126075: Triangle T(n,k), 0 <= k <= n, read by rows, defined by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = 2*T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1) + T(n-1,k+1) for k >= 1.
A213709: Number of steps to go from 2^(n+1)-1 to (2^n)-1 using the iterative process described in A071542.
A256631: Numbers n such that the decimal expansions of both n and n^2 have 0 as smallest digit and 5 as largest digit.
A299263: Partial sums of A299257.
A299277: Coordination sequence for "pcu-i" 3D uniform tiling.
A299279: Coordination sequence for "reo" 3D uniform tiling.