Base | Representation |
---|---|
bin | 100101101010100100110001… |
… | …011111111111100111100111 |
3 | 210201112022102221120012202010 |
4 | 211222210301133333213213 |
5 | 133203031203033010210 |
6 | 1344152044340045303 |
7 | 46615031163266100 |
oct | 4552446137774747 |
9 | 721468387505663 |
10 | 165653424110055 |
11 | 4886724a374a02 |
12 | 166b48b0693833 |
13 | 71580879a081b |
14 | 2cc995054b3a7 |
15 | 142405bbc2920 |
hex | 96a9317ff9e7 |
165653424110055 has 48 divisors (see below), whose sum is σ = 308330823097440. Its totient is φ = 75724181584128.
The previous prime is 165653424110051. The next prime is 165653424110129. The reversal of 165653424110055 is 550011424356561.
It is not a de Polignac number, because 165653424110055 - 22 = 165653424110051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 165653424109986 and 165653424110013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (165653424110051) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 13416237 + ... + 22611993.
It is an arithmetic number, because the mean of its divisors is an integer number (6423558814530).
Almost surely, 2165653424110055 is an apocalyptic number.
165653424110055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
165653424110055 is a deficient number, since it is larger than the sum of its proper divisors (142677398987385).
165653424110055 is a wasteful number, since it uses less digits than its factorization.
165653424110055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9220288 (or 9220281 counting only the distinct ones).
The product of its (nonzero) digits is 2160000, while the sum is 48.
The spelling of 165653424110055 in words is "one hundred sixty-five trillion, six hundred fifty-three billion, four hundred twenty-four million, one hundred ten thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •