Base | Representation |
---|---|
bin | 100101100001101110101100… |
… | …100011000010100110000101 |
3 | 210122101012112212012020021120 |
4 | 211201232230203002212011 |
5 | 133113101343401301323 |
6 | 1343004523043304153 |
7 | 46523102622340632 |
oct | 4541565443024605 |
9 | 718335485166246 |
10 | 165045603150213 |
11 | 486524a1280535 |
12 | 16616b3a67b059 |
13 | 711296c929236 |
14 | 2ca836d6c7189 |
15 | 14133354235e3 |
hex | 961bac8c2985 |
165045603150213 has 32 divisors (see below), whose sum is σ = 240524520394752. Its totient is φ = 100216337913600.
The previous prime is 165045603150209. The next prime is 165045603150269. The reversal of 165045603150213 is 312051306540561.
It is a happy number.
It is not a de Polignac number, because 165045603150213 - 22 = 165045603150209 is a prime.
It is a super-2 number, since 2×1650456031502132 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (165045603150613) 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, 156199570 + ... + 157252652.
It is an arithmetic number, because the mean of its divisors is an integer number (7516391262336).
Almost surely, 2165045603150213 is an apocalyptic number.
It is an amenable number.
165045603150213 is a deficient number, since it is larger than the sum of its proper divisors (75478917244539).
165045603150213 is a wasteful number, since it uses less digits than its factorization.
165045603150213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1152265.
The product of its (nonzero) digits is 324000, while the sum is 42.
Adding to 165045603150213 its reverse (312051306540561), we get a palindrome (477096909690774).
The spelling of 165045603150213 in words is "one hundred sixty-five trillion, forty-five billion, six hundred three million, one hundred fifty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.589 sec. • engine limits •