Base | Representation |
---|---|
bin | 1010000110000110110001… |
… | …0001110100001001000011 |
3 | 1110022011001221001212200011 |
4 | 2201201230101310021003 |
5 | 2423330311044232321 |
6 | 35335135234005351 |
7 | 2223643435055254 |
oct | 241415421641103 |
9 | 43264057055604 |
10 | 11100012102211 |
11 | 359a54150063a |
12 | 12b330b716857 |
13 | 62695a5b0166 |
14 | 2a535a066b2b |
15 | 143b0b9d4ae1 |
hex | a186c474243 |
11100012102211 has 2 divisors, whose sum is σ = 11100012102212. Its totient is φ = 11100012102210.
The previous prime is 11100012102197. The next prime is 11100012102259. The reversal of 11100012102211 is 11220121000111.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11100012102211 - 27 = 11100012102083 is a prime.
It is a super-2 number, since 2×111000121022112 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11100012102191 and 11100012102200.
It is not a weakly prime, because it can be changed into another prime (11100012102611) 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 as a sum of consecutive naturals, namely, 5550006051105 + 5550006051106.
It is an arithmetic number, because the mean of its divisors is an integer number (5550006051106).
Almost surely, 211100012102211 is an apocalyptic number.
11100012102211 is a deficient number, since it is larger than the sum of its proper divisors (1).
11100012102211 is an equidigital number, since it uses as much as digits as its factorization.
11100012102211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11100012102211 its reverse (11220121000111), we get a palindrome (22320133102322).
The spelling of 11100012102211 in words is "eleven trillion, one hundred billion, twelve million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •