Base | Representation |
---|---|
bin | 100101100100001100100101… |
… | …010010000001000100110111 |
3 | 210122222102010122111020021002 |
4 | 211210030211102001010313 |
5 | 133123341042402031343 |
6 | 1343214441204513515 |
7 | 46541253666554324 |
oct | 4544144522010467 |
9 | 718872118436232 |
10 | 165215132455223 |
11 | 48708387137584 |
12 | 166439716ab89b |
13 | 71259491bba76 |
14 | 2cb2652a35b4b |
15 | 14179587938b8 |
hex | 964325481137 |
165215132455223 has 32 divisors (see below), whose sum is σ = 175092191116800. Its totient is φ = 155460531360384.
The previous prime is 165215132455213. The next prime is 165215132455249. The reversal of 165215132455223 is 322554231512561.
It is a cyclic number.
It is not a de Polignac number, because 165215132455223 - 210 = 165215132454199 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (165215132455213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2324678933 + ... + 2324750001.
It is an arithmetic number, because the mean of its divisors is an integer number (5471630972400).
Almost surely, 2165215132455223 is an apocalyptic number.
165215132455223 is a deficient number, since it is larger than the sum of its proper divisors (9877058661577).
165215132455223 is a wasteful number, since it uses less digits than its factorization.
165215132455223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72759.
The product of its digits is 2160000, while the sum is 47.
Adding to 165215132455223 its reverse (322554231512561), we get a palindrome (487769363967784).
The spelling of 165215132455223 in words is "one hundred sixty-five trillion, two hundred fifteen billion, one hundred thirty-two million, four hundred fifty-five thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •