Base | Representation |
---|---|
bin | 1010000000111011100111… |
… | …1001110001101010000011 |
3 | 1102222122121220002210210011 |
4 | 2200032321321301222003 |
5 | 2420401233222011321 |
6 | 35230234434045351 |
7 | 2214345551436604 |
oct | 240167171615203 |
9 | 42878556083704 |
10 | 11011120110211 |
11 | 3565876274341 |
12 | 129a041a19857 |
13 | 61b4621b3820 |
14 | 2a0d2638ddab |
15 | 141657a71ae1 |
hex | a03b9e71a83 |
11011120110211 has 16 divisors (see below), whose sum is σ = 11898621903168. Its totient is φ = 10129415961600.
The previous prime is 11011120110209. The next prime is 11011120110223. The reversal of 11011120110211 is 11201102111011.
It is not a de Polignac number, because 11011120110211 - 21 = 11011120110209 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 11011120110191 and 11011120110200.
It is not an unprimeable number, because it can be changed into a prime (11011120110251) 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, 20274475 + ... + 20810491.
It is an arithmetic number, because the mean of its divisors is an integer number (743663868948).
Almost surely, 211011120110211 is an apocalyptic number.
11011120110211 is a deficient number, since it is larger than the sum of its proper divisors (887501792957).
11011120110211 is a wasteful number, since it uses less digits than its factorization.
11011120110211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 541422.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11011120110211 its reverse (11201102111011), we get a palindrome (22212222221222).
The spelling of 11011120110211 in words is "eleven trillion, eleven billion, one hundred twenty million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •