Base | Representation |
---|---|
bin | 1010000110000111001000… |
… | …1011001010011110111011 |
3 | 1110022011022211012112010110 |
4 | 2201201302023022132323 |
5 | 2423331011410201021 |
6 | 35335153130115403 |
7 | 2223646045631214 |
oct | 241416213123673 |
9 | 43264284175113 |
10 | 11100111022011 |
11 | 359a592324540 |
12 | 12b333887bb63 |
13 | 626974c3609b |
14 | 2a536925640b |
15 | 143b15524476 |
hex | a18722ca7bb |
11100111022011 has 32 divisors (see below), whose sum is σ = 16556446884096. Its totient is φ = 6556498496000.
The previous prime is 11100111021889. The next prime is 11100111022019. The reversal of 11100111022011 is 11022011100111.
11100111022011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11100111022011 - 210 = 11100111020987 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11100111022019) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2910786 + ... + 5538311.
It is an arithmetic number, because the mean of its divisors is an integer number (517388965128).
Almost surely, 211100111022011 is an apocalyptic number.
11100111022011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11100111022011 is a deficient number, since it is larger than the sum of its proper divisors (5456335862085).
11100111022011 is a wasteful number, since it uses less digits than its factorization.
11100111022011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8450123.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11100111022011 its reverse (11022011100111), we get a palindrome (22122122122122).
The spelling of 11100111022011 in words is "eleven trillion, one hundred billion, one hundred eleven million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •