Search a number
BaseRepresentation
bin11010101001
32100011
4122221
523310
611521
74654
oct3251
92304
101705
111310
12ba1
13a12
1489b
1578a
hex6a9

1705 has 8 divisors (see below), whose sum is σ = 2304. Its totient is φ = 1200.

The previous prime is 1699. The next prime is 1709. The reversal of 1705 is 5071.

1705 is nontrivially palindromic in base 4.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 1705 - 23 = 1697 is a prime.

It is a tribonacci number.

It is a Duffinian number.

1705 is a lucky number.

It is a plaindrome in base 14 and base 15.

It is a nialpdrome in base 12.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1709) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40 + ... + 70.

It is an arithmetic number, because the mean of its divisors is an integer number (288).

It is an amenable number.

1705 is a deficient number, since it is larger than the sum of its proper divisors (599).

1705 is a wasteful number, since it uses less digits than its factorization.

1705 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 47.

The product of its (nonzero) digits is 35, while the sum is 13.

The square root of 1705 is about 41.2916456441. The cubic root of 1705 is about 11.9465212822.

Adding to 1705 its reverse (5071), we get a palindrome (6776).

The spelling of 1705 in words is "one thousand, seven hundred five".

Divisors: 1 5 11 31 55 155 341 1705