Base | Representation |
---|---|
bin | 10000000001100001100… |
… | …110001000111111001011 |
3 | 10220021020222010211101022 |
4 | 100001201212020333023 |
5 | 121020123122003021 |
6 | 2201505540543055 |
7 | 142361333126312 |
oct | 20014146107713 |
9 | 3807228124338 |
10 | 1101149016011 |
11 | 394aa3a04800 |
12 | 1594b06b1a8b |
13 | 7cab7b5b4c5 |
14 | 3b41dd25279 |
15 | 1d99b7ba1ab |
hex | 10061988fcb |
1101149016011 has 24 divisors (see below), whose sum is σ = 1284088995840. Its totient is φ = 940890368880.
The previous prime is 1101149015977. The next prime is 1101149016053. The reversal of 1101149016011 is 1106109411011.
It is not a de Polignac number, because 1101149016011 - 214 = 1101148999627 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1101149016511) 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, 1593731 + ... + 2177676.
It is an arithmetic number, because the mean of its divisors is an integer number (53503708160).
Almost surely, 21101149016011 is an apocalyptic number.
1101149016011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1101149016011 is a deficient number, since it is larger than the sum of its proper divisors (182939979829).
1101149016011 is a wasteful number, since it uses less digits than its factorization.
1101149016011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3771575 (or 3771564 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 26.
The spelling of 1101149016011 in words is "one trillion, one hundred one billion, one hundred forty-nine million, sixteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •