Base | Representation |
---|---|
bin | 101101101100111101111001… |
… | …011001000111000011000111 |
3 | 222100200121211200122120021120 |
4 | 231230331321121013003013 |
5 | 202321210012021023421 |
6 | 1551255050243445023 |
7 | 60223634112230604 |
oct | 5554757131070307 |
9 | 870617750576246 |
10 | 201002211111111 |
11 | 590556170677a3 |
12 | 1a6636a9986773 |
13 | 8820572679597 |
14 | 378c7b799b6ab |
15 | 18387de9b98c6 |
hex | b6cf796470c7 |
201002211111111 has 32 divisors (see below), whose sum is σ = 270352074297600. Its totient is φ = 132831756330240.
The previous prime is 201002211111017. The next prime is 201002211111131. The reversal of 201002211111111 is 111111112200102.
It is not a de Polignac number, because 201002211111111 - 213 = 201002211102919 is a prime.
201002211111111 is a modest number, since divided by 11111111 gives 2010022 as remainder.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201002211111131) 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, 1338182065 + ... + 1338332261.
It is an arithmetic number, because the mean of its divisors is an integer number (8448502321800).
Almost surely, 2201002211111111 is an apocalyptic number.
201002211111111 is a deficient number, since it is larger than the sum of its proper divisors (69349863186489).
201002211111111 is a wasteful number, since it uses less digits than its factorization.
201002211111111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158239.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 201002211111111 its reverse (111111112200102), we get a palindrome (312113323311213).
The spelling of 201002211111111 in words is "two hundred one trillion, two billion, two hundred eleven million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •