Base | Representation |
---|---|
bin | 10011101011000… |
… | …11000001111000 |
3 | 102111112111102101 |
4 | 21311203001320 |
5 | 314222011211 |
6 | 24213113144 |
7 | 4042515010 |
oct | 1165430170 |
9 | 374474371 |
10 | 165032056 |
11 | 8517a032 |
12 | 473287b4 |
13 | 28263007 |
14 | 17cbcc40 |
15 | e74d5c1 |
hex | 9d63078 |
165032056 has 64 divisors (see below), whose sum is σ = 376574400. Its totient is φ = 66189312.
The previous prime is 165032047. The next prime is 165032057. The reversal of 165032056 is 650230561.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (165032057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 217630 + ... + 218386.
It is an arithmetic number, because the mean of its divisors is an integer number (5883975).
Almost surely, 2165032056 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 165032056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (188287200).
165032056 is an abundant number, since it is smaller than the sum of its proper divisors (211542344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
165032056 is a wasteful number, since it uses less digits than its factorization.
165032056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1016 (or 1012 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 28.
The square root of 165032056 is about 12846.4802961745. The cubic root of 165032056 is about 548.5161723289.
The spelling of 165032056 in words is "one hundred sixty-five million, thirty-two thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •