Number of the day: 1283

Properties of the number 1283:

1283 is the 208^th prime.
1283 has 17 antidivisors and 1282 totatives.
1283 has a semiprime digit sum 14 in base 10.
Reversing the decimal digits of 1283 results in an emirp.
1283 = 642² - 641² is the difference of 2 nonnegative squares in 1 way.
1283 is the difference of 2 positive pentagonal numbers in 1 way.
1283 = 3² + 7² + 35² is the sum of 3 positive squares.
1283² is the sum of 3 positive squares.
1283 is a divisor of 3⁶⁴¹ - 1.
1283 is an emirp in (at least) the following bases: 5, 6, 7, 10, 13, 16, 19, 29, 30, 32, 35, 36, 41, 44, 45, 46, 49, 51, 53, 54, 55, 59, 66, 71, 73, 74, 75, 77, 83, 87, 89, 92, and 96.
1283 is palindromic in (at least) the following bases: 20, and 21.
1283 in base 6 = 5535 and consists of only the digits '3' and '5'.
1283 in base 13 = 779 and consists of only the digits '7' and '9'.
1283 in base 19 = 3aa and consists of only the digits '3' and 'a'.
1283 in base 20 = 343 and consists of only the digits '3' and '4'.
1283 in base 21 = 2j2 and consists of only the digits '2' and 'j'.
1283 in base 35 = 11n and consists of only the digits '1' and 'n'.

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

Sequence numbers and descriptions below are taken from OEIS.
A000057: Primes dividing all Fibonacci sequences.
A005265: a(1)=3, b(n)=Product_{k=1..n} a(k), a(n+1)=smallest prime factor of b(n)-1.
A005385: Safe primes p: (p-1)/2 is also prime.
A023202: Numbers n such that n and n + 8 both prime.
A034253: Triangle read by rows: T(n,k) = number of inequivalent linear [n,k] binary codes without 0 columns (n >= 1, 1 <= k <= n).
A046132: Larger member p+4 of cousin primes (p, p+4).
A048988: Primes of form 4n^2 + 4n + 59.
A065720: Primes whose binary representation is also the decimal representation of a prime.
A175791: Primes that become another prime under the map 1 <-> 0 (acting on the digits: A222210), cf. A171013.
A213891: Fixed points of the sequence A262212 defined by the minimum number of 2's in the relation n*[n,2,2,...,2,n] = [x,...,x] between simple continued fractions.