Search a number
-
+
165152 = 2513397
BaseRepresentation
bin101000010100100000
322101112202
4220110200
520241102
63312332
71255331
oct502440
9271482
10165152
11103099
127b6a8
135a230
1444288
1533e02
hex28520

165152 has 24 divisors (see below), whose sum is σ = 351036. Its totient is φ = 76032.

The previous prime is 165133. The next prime is 165161. The reversal of 165152 is 251561.

It can be written as a sum of positive squares in 2 ways, for example, as 163216 + 1936 = 404^2 + 44^2 .

It is an unprimeable number.

165152 is an untouchable number, because it is not equal to the sum of proper divisors of any number.

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

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

165152 is a Friedman number, since it can be written as 5161*2^5, using all its digits and the basic arithmetic operations.

2165152 is an apocalyptic number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 165152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (175518).

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

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

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

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

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

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

The square root of 165152 is about 406.3889762284. The cubic root of 165152 is about 54.8649025895.

The spelling of 165152 in words is "one hundred sixty-five thousand, one hundred fifty-two".

Divisors: 1 2 4 8 13 16 26 32 52 104 208 397 416 794 1588 3176 5161 6352 10322 12704 20644 41288 82576 165152