Base | Representation |
---|---|
bin | 1010000001011100101111… |
… | …0010000101110101110011 |
3 | 1110000111120110001000201002 |
4 | 2200113023302011311303 |
5 | 2421022440031121321 |
6 | 35234304523432215 |
7 | 2215112056432553 |
oct | 240271362056563 |
9 | 43014513030632 |
10 | 11020010020211 |
11 | 35696184022a5 |
12 | 129b90308566b |
13 | 61c24abc97ba |
14 | 2a152ad09163 |
15 | 1419c825420b |
hex | a05cbc85d73 |
11020010020211 has 16 divisors (see below), whose sum is σ = 11063939932416. Its totient is φ = 10976183725536.
The previous prime is 11020010020199. The next prime is 11020010020219. The reversal of 11020010020211 is 11202001002011.
11020010020211 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 11020010020211 - 226 = 11019942911347 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11020010020192 and 11020010020201.
It is not an unprimeable number, because it can be changed into a prime (11020010020219) 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, 898632866 + ... + 898645128.
It is an arithmetic number, because the mean of its divisors is an integer number (691496245776).
Almost surely, 211020010020211 is an apocalyptic number.
11020010020211 is a deficient number, since it is larger than the sum of its proper divisors (43929912205).
11020010020211 is a wasteful number, since it uses less digits than its factorization.
11020010020211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16202.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11020010020211 its reverse (11202001002011), we get a palindrome (22222011022222).
The spelling of 11020010020211 in words is "eleven trillion, twenty billion, ten million, twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •