Base | Representation |
---|---|
bin | 11110101110000110101… |
… | …000010001001101101110 |
3 | 21110211002022211221112200 |
4 | 132232012220101031232 |
5 | 234042001414124200 |
6 | 4253453102442330 |
7 | 305343501624552 |
oct | 36560650211556 |
9 | 7424068757480 |
10 | 2111087645550 |
11 | 744341a38114 |
12 | 2a1186b933a6 |
13 | 1240c81a7810 |
14 | 7426a2b7862 |
15 | 39daa81a800 |
hex | 1eb86a1136e |
2111087645550 has 144 divisors (see below), whose sum is σ = 6108738286560. Its totient is φ = 519596363520.
The previous prime is 2111087645479. The next prime is 2111087645567. The reversal of 2111087645550 is 555467801112.
2111087645550 is a `hidden beast` number, since 2 + 1 + 1 + 10 + 87 + 6 + 4 + 5 + 550 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a junction number, because it is equal to n+sod(n) for n = 2111087645496 and 2111087645505.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 89604372 + ... + 89627928.
Almost surely, 22111087645550 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2111087645550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3054369143280).
2111087645550 is an abundant number, since it is smaller than the sum of its proper divisors (3997650641010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2111087645550 is a wasteful number, since it uses less digits than its factorization.
2111087645550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38907 (or 38899 counting only the distinct ones).
The product of its (nonzero) digits is 336000, while the sum is 45.
The spelling of 2111087645550 in words is "two trillion, one hundred eleven billion, eighty-seven million, six hundred forty-five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •