Search a number
BaseRepresentation
bin11001110100
32021012
4121310
523102
611352
74550
oct3164
92235
101652
111272
12b58
139a1
14860
15752
hex674

1652 has 12 divisors (see below), whose sum is σ = 3360. Its totient is φ = 696.

The previous prime is 1637. The next prime is 1657. The reversal of 1652 is 2561.

Subtracting 1652 from its reverse (2561), we obtain a palindrome (909).

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

It is an alternating number because its digits alternate between odd and even.

It is a plaindrome in base 9.

It is a nialpdrome in base 14 and base 15.

It is a congruent number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2 + ... + 57.

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

21652 is an apocalyptic number.

It is an amenable number.

1652 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

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

It is a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1680).

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

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

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

The product of its digits is 60, while the sum is 14.

The square root of 1652 is about 40.6448028658. The cubic root of 1652 is about 11.8214299840.

The spelling of 1652 in words is "one thousand, six hundred fifty-two".

Divisors: 1 2 4 7 14 28 59 118 236 413 826 1652