Base | Representation |
---|---|
bin | 1010000111010101010101… |
… | …0110001100100010001011 |
3 | 1110101011111201211102100022 |
4 | 2201311111112030202023 |
5 | 2424202004131224321 |
6 | 35352544104131055 |
7 | 2225321165041436 |
oct | 241652526144213 |
9 | 43334451742308 |
10 | 11121102211211 |
11 | 35a84842a9693 |
12 | 12b7416766a8b |
13 | 62893ba846b5 |
14 | 2a639b03481d |
15 | 1444432d0dab |
hex | a1d5558c88b |
11121102211211 has 8 divisors (see below), whose sum is σ = 11287346810544. Its totient is φ = 10955233307520.
The previous prime is 11121102211207. The next prime is 11121102211259. The reversal of 11121102211211 is 11211220112111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11121102211211 - 22 = 11121102211207 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11121102211211.
It is not an unprimeable number, because it can be changed into a prime (11121102213211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 93864266 + ... + 93982671.
It is an arithmetic number, because the mean of its divisors is an integer number (1410918351318).
Almost surely, 211121102211211 is an apocalyptic number.
11121102211211 is a deficient number, since it is larger than the sum of its proper divisors (166244599333).
11121102211211 is an equidigital number, since it uses as much as digits as its factorization.
11121102211211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 187847821.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 11121102211211 its reverse (11211220112111), we get a palindrome (22332322323322).
The spelling of 11121102211211 in words is "eleven trillion, one hundred twenty-one billion, one hundred two million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •