Search a number
BaseRepresentation
bin11001000010
32012100
4121002
522402
611230
74446
oct3102
92170
101602
111227
12b16
13963
14826
1571c
hex642

1602 has 12 divisors (see below), whose sum is σ = 3510. Its totient is φ = 528.

The previous prime is 1601. The next prime is 1607. The reversal of 1602 is 2061.

Adding to 1602 its reverse (2061), we get a palindrome (3663).

It can be written as a sum of positive squares in only one way, i.e., 1521 + 81 = 39^2 + 9^2 .

It is a Harshad number since it is a multiple of its sum of digits (9).

It is an Ulam number.

It is a plaindrome in base 7 and base 11.

It is a nialpdrome in base 13 and base 16.

It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 1602.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 27 + ... + 62.

1602 is an abundant number, since it is smaller than the sum of its proper divisors (1908).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 97 (or 94 counting only the distinct ones).

The product of its (nonzero) digits is 12, while the sum is 9.

The square root of 1602 is about 40.0249921924. The cubic root of 1602 is about 11.7009422866.

The spelling of 1602 in words is "one thousand, six hundred two".

Divisors: 1 2 3 6 9 18 89 178 267 534 801 1602