Base | Representation |
---|---|
bin | 10000000000100011101… |
… | …010101001011101100011 |
3 | 10220011120120001212101000 |
4 | 100000203222221131203 |
5 | 121011011130311321 |
6 | 2201214503243043 |
7 | 142323515541012 |
oct | 20004352513543 |
9 | 3804516055330 |
10 | 1100110010211 |
11 | 39461046a323 |
12 | 159260749483 |
13 | 7c980815184 |
14 | 3b361d42a79 |
15 | 1d93a481826 |
hex | 10023aa9763 |
1100110010211 has 16 divisors (see below), whose sum is σ = 1629877432320. Its totient is φ = 733368502440.
The previous prime is 1100110010201. The next prime is 1100110010213. The reversal of 1100110010211 is 1120100110011.
It is not a de Polignac number, because 1100110010211 - 29 = 1100110009699 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1100110010193 and 1100110010202.
It is not an unprimeable number, because it can be changed into a prime (1100110010213) 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 15 ways as a sum of consecutive naturals, for example, 527055 + ... + 1574168.
It is an arithmetic number, because the mean of its divisors is an integer number (101867339520).
Almost surely, 21100110010211 is an apocalyptic number.
1100110010211 is a deficient number, since it is larger than the sum of its proper divisors (529767422109).
1100110010211 is a wasteful number, since it uses less digits than its factorization.
1100110010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2120623 (or 2120617 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1100110010211 its reverse (1120100110011), we get a palindrome (2220210120222).
The spelling of 1100110010211 in words is "one trillion, one hundred billion, one hundred ten million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •