Base | Representation |
---|---|
bin | 11000000000110101111101… |
… | …000111101001111011101001 |
3 | 111211221022120122210212200021 |
4 | 120000311331013221323221 |
5 | 102320312412300000410 |
6 | 1012341014021240441 |
7 | 31150101162203236 |
oct | 3000657507517351 |
9 | 454838518725607 |
10 | 105611050000105 |
11 | 307184384a5921 |
12 | ba18166b63121 |
13 | 46c110524a4c0 |
14 | 1c1186020678d |
15 | c322bbec7eda |
hex | 600d7d1e9ee9 |
105611050000105 has 32 divisors (see below), whose sum is σ = 147006286035840. Its totient is φ = 72166722163200.
The previous prime is 105611050000087. The next prime is 105611050000123. The reversal of 105611050000105 is 501000050116501.
It is an interprime number because it is at equal distance from previous prime (105611050000087) and next prime (105611050000123).
It is not a de Polignac number, because 105611050000105 - 243 = 96814956977897 is a prime.
It is a super-2 number, since 2×1056110500001052 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105611050000105.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 994307596 + ... + 994413805.
It is an arithmetic number, because the mean of its divisors is an integer number (4593946438620).
Almost surely, 2105611050000105 is an apocalyptic number.
It is an amenable number.
105611050000105 is a deficient number, since it is larger than the sum of its proper divisors (41395236035735).
105611050000105 is a wasteful number, since it uses less digits than its factorization.
105611050000105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1988721481.
The product of its (nonzero) digits is 750, while the sum is 25.
The spelling of 105611050000105 in words is "one hundred five trillion, six hundred eleven billion, fifty million, one hundred five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •