Base | Representation |
---|---|
bin | 101101101110101011101100… |
… | …110001100010010110001011 |
3 | 222101002220011100010001022020 |
4 | 231232223230301202112023 |
5 | 202330122441404324321 |
6 | 1551425145315455523 |
7 | 60235306560652020 |
oct | 5556535461422613 |
9 | 871086140101266 |
10 | 201120111011211 |
11 | 590a0618525767 |
12 | 1a6825122b75a3 |
13 | 882b71173c492 |
14 | 37943a002d547 |
15 | 183b8e03d84c6 |
hex | b6eaecc6258b |
201120111011211 has 32 divisors (see below), whose sum is σ = 306738178698240. Its totient is φ = 114824750699136.
The previous prime is 201120111011201. The next prime is 201120111011213. The reversal of 201120111011211 is 112110111021102.
It is not a de Polignac number, because 201120111011211 - 226 = 201120043902347 is a prime.
It is a super-2 number, since 2×2011201110112112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (201120111011213) 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, 406683385 + ... + 407177621.
It is an arithmetic number, because the mean of its divisors is an integer number (9585568084320).
Almost surely, 2201120111011211 is an apocalyptic number.
201120111011211 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
201120111011211 is a deficient number, since it is larger than the sum of its proper divisors (105618067687029).
201120111011211 is a wasteful number, since it uses less digits than its factorization.
201120111011211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 511243.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 201120111011211 its reverse (112110111021102), we get a palindrome (313230222032313).
The spelling of 201120111011211 in words is "two hundred one trillion, one hundred twenty billion, one hundred eleven million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •