Search a number
-
+
1595 = 51129
BaseRepresentation
bin11000111011
32012002
4120323
522340
611215
74436
oct3073
92162
101595
111220
12b0b
13959
1481d
15715
hex63b

1595 has 8 divisors (see below), whose sum is σ = 2160. Its totient is φ = 1120.

The previous prime is 1583. The next prime is 1597. The reversal of 1595 is 5951.

Subtracting 1595 from its reverse (5951), we obtain a square (4356 = 662).

1595 = T20 + T21 + ... + T25.

1595 is nontrivially palindromic in base 12 and base 13.

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

It is not a de Polignac number, because 1595 - 24 = 1579 is a prime.

1595 is an undulating number in base 12 and base 13.

Its product of digits (225) is a multiple of the sum of its prime divisors (45).

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (7) of ones.

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

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

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

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

1595 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 45.

The product of its digits is 225, while the sum is 20.

The square root of 1595 is about 39.9374510954. The cubic root of 1595 is about 11.6838748325.

The spelling of 1595 in words is "one thousand, five hundred ninety-five".

Divisors: 1 5 11 29 55 145 319 1595