Base | Representation |
---|---|
bin | 10000000001011001000… |
… | …100100111101010110101 |
3 | 10220020220000001102110200 |
4 | 100001121010213222311 |
5 | 121014330014323221 |
6 | 2201443431511113 |
7 | 142354645452255 |
oct | 20013104475265 |
9 | 3806800042420 |
10 | 1101006011061 |
11 | 394a3020aaa0 |
12 | 159470828499 |
13 | 7ca9433b4a8 |
14 | 3b408d3b965 |
15 | 1d98de6d426 |
hex | 10059127ab5 |
1101006011061 has 24 divisors (see below), whose sum is σ = 1736349023136. Its totient is φ = 666726193440.
The previous prime is 1101006011059. The next prime is 1101006011069. The reversal of 1101006011061 is 1601106001011.
1101006011061 is a `hidden beast` number, since 1 + 1 + 0 + 1 + 0 + 0 + 601 + 1 + 0 + 61 = 666.
It is not a de Polignac number, because 1101006011061 - 21 = 1101006011059 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101006011069) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 4464115 + ... + 4704288.
It is an arithmetic number, because the mean of its divisors is an integer number (72347875964).
Almost surely, 21101006011061 is an apocalyptic number.
1101006011061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1101006011061 is a deficient number, since it is larger than the sum of its proper divisors (635343012075).
1101006011061 is a wasteful number, since it uses less digits than its factorization.
1101006011061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9169633 (or 9169630 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
The spelling of 1101006011061 in words is "one trillion, one hundred one billion, six million, eleven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •