Base | Representation |
---|---|
bin | 10011101101000… |
… | …01100001101101 |
3 | 102112000111120110 |
4 | 21312201201231 |
5 | 314303204140 |
6 | 24222410233 |
7 | 4044632226 |
oct | 1166414155 |
9 | 375014513 |
10 | 165288045 |
11 | 8533439a |
12 | 47430979 |
13 | 283226a0 |
14 | 17d4824d |
15 | e79e380 |
hex | 9da186d |
165288045 has 32 divisors (see below), whose sum is σ = 285667200. Its totient is φ = 81126144.
The previous prime is 165288043. The next prime is 165288061. The reversal of 165288045 is 540882561.
165288045 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 165288045 - 21 = 165288043 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 165287994 and 165288012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (165288043) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 74766 + ... + 76944.
It is an arithmetic number, because the mean of its divisors is an integer number (8927100).
Almost surely, 2165288045 is an apocalyptic number.
165288045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
165288045 is a deficient number, since it is larger than the sum of its proper divisors (120379155).
165288045 is a wasteful number, since it uses less digits than its factorization.
165288045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2589.
The product of its (nonzero) digits is 76800, while the sum is 39.
The square root of 165288045 is about 12856.4398260172. The cubic root of 165288045 is about 548.7996355771.
The spelling of 165288045 in words is "one hundred sixty-five million, two hundred eighty-eight thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •