Base | Representation |
---|---|
bin | 10000000000101010001… |
… | …11100010010110000001 |
3 | 1221120221010020002220110 |
4 | 20000111013202112001 |
5 | 33003111142023410 |
6 | 1100414520501533 |
7 | 54513145535622 |
oct | 10002507422601 |
9 | 1846833202813 |
10 | 550110111105 |
11 | 1a23338a8665 |
12 | 8a74691a8a9 |
13 | 3cb4b9615a9 |
14 | 1c8a8417a49 |
15 | e499ec8720 |
hex | 80151e2581 |
550110111105 has 32 divisors (see below), whose sum is σ = 908623872000. Its totient is φ = 283910639040.
The previous prime is 550110111101. The next prime is 550110111107. The reversal of 550110111105 is 501111011055.
It is not a de Polignac number, because 550110111105 - 22 = 550110111101 is a prime.
It is a super-2 number, since 2×5501101111052 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (550110111101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12066784 + ... + 12112286.
It is an arithmetic number, because the mean of its divisors is an integer number (28394496000).
Almost surely, 2550110111105 is an apocalyptic number.
It is an amenable number.
550110111105 is a deficient number, since it is larger than the sum of its proper divisors (358513760895).
550110111105 is a wasteful number, since it uses less digits than its factorization.
550110111105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71541.
The product of its (nonzero) digits is 125, while the sum is 21.
The spelling of 550110111105 in words is "five hundred fifty billion, one hundred ten million, one hundred eleven thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.354 sec. • engine limits •