Base | Representation |
---|---|
bin | 10000000000011101001… |
… | …111000000001100101011 |
3 | 10220011022001000110101221 |
4 | 100000131033000030223 |
5 | 121010301014200021 |
6 | 2201200050322511 |
7 | 142321035402013 |
oct | 20003517001453 |
9 | 3804261013357 |
10 | 1100002100011 |
11 | 394565565841 |
12 | 159230589437 |
13 | 7c964362099 |
14 | 3b351892c43 |
15 | 1d930c68241 |
hex | 1001d3c032b |
1100002100011 has 16 divisors (see below), whose sum is σ = 1227619856160. Its totient is φ = 979517767680.
The previous prime is 1100002099993. The next prime is 1100002100023. The reversal of 1100002100011 is 1100012000011.
It is not a de Polignac number, because 1100002100011 - 27 = 1100002099883 is a prime.
It is a super-2 number, since 2×11000021000112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1100002099967 and 1100002100003.
It is not an unprimeable number, because it can be changed into a prime (1100002100051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1991766 + ... + 2483371.
It is an arithmetic number, because the mean of its divisors is an integer number (76726241010).
Almost surely, 21100002100011 is an apocalyptic number.
1100002100011 is a deficient number, since it is larger than the sum of its proper divisors (127617756149).
1100002100011 is a wasteful number, since it uses less digits than its factorization.
1100002100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4475934.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 1100002100011 its reverse (1100012000011), we get a palindrome (2200014100022).
The spelling of 1100002100011 in words is "one trillion, one hundred billion, two million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •