Base | Representation |
---|---|
bin | 1010000111011000110000… |
… | …1011010010110011110011 |
3 | 1110101020212211202121211021 |
4 | 2201312030023102303303 |
5 | 2424210400124201321 |
6 | 35353215244400311 |
7 | 2225353035004531 |
oct | 241661413226363 |
9 | 43336784677737 |
10 | 11122022100211 |
11 | 35a8906585930 |
12 | 12b7632846097 |
13 | 628a57522b09 |
14 | 2a644728b151 |
15 | 144498e3a941 |
hex | a1d8c2d2cf3 |
11122022100211 has 16 divisors (see below), whose sum is σ = 12336892816896. Its totient is φ = 9941245380000.
The previous prime is 11122022100149. The next prime is 11122022100239. The reversal of 11122022100211 is 11200122022111.
11122022100211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11122022100211 - 213 = 11122022092019 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11122022100251) 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, 1576155 + ... + 4972756.
It is an arithmetic number, because the mean of its divisors is an integer number (771055801056).
Almost surely, 211122022100211 is an apocalyptic number.
11122022100211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11122022100211 is a deficient number, since it is larger than the sum of its proper divisors (1214870716685).
11122022100211 is a wasteful number, since it uses less digits than its factorization.
11122022100211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6551514.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11122022100211 its reverse (11200122022111), we get a palindrome (22322144122322).
The spelling of 11122022100211 in words is "eleven trillion, one hundred twenty-two billion, twenty-two million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •