Base | Representation |
---|---|
bin | 10000000101101011001… |
… | …100110010110100001100 |
3 | 10220200202112001220121101 |
4 | 100011223030302310030 |
5 | 121103234402023202 |
6 | 2203524042312444 |
7 | 142606632246121 |
oct | 20055314626414 |
9 | 3820675056541 |
10 | 1105605111052 |
11 | 396980297982 |
12 | 15a334ab8724 |
13 | 80348101c30 |
14 | 3b723a82748 |
15 | 1db5cad4887 |
hex | 1016b332d0c |
1105605111052 has 24 divisors (see below), whose sum is σ = 2087017513056. Its totient is φ = 509452234368.
The previous prime is 1105605111049. The next prime is 1105605111101. The reversal of 1105605111052 is 2501115065011.
It is a self number, because there is not a number n which added to its sum of digits gives 1105605111052.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17197768 + ... + 17261935.
It is an arithmetic number, because the mean of its divisors is an integer number (86959063044).
Almost surely, 21105605111052 is an apocalyptic number.
It is an amenable number.
1105605111052 is a deficient number, since it is larger than the sum of its proper divisors (981412402004).
1105605111052 is a wasteful number, since it uses less digits than its factorization.
1105605111052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34460337 (or 34460335 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 28.
The spelling of 1105605111052 in words is "one trillion, one hundred five billion, six hundred five million, one hundred eleven thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •