Base | Representation |
---|---|
bin | 101101101101001111100000… |
… | …011101001110000110100011 |
3 | 222100202102122111021021202012 |
4 | 231231033200131032012203 |
5 | 202322012223222023021 |
6 | 1551311454441143135 |
7 | 60225203516124314 |
oct | 5555174035160643 |
9 | 870672574237665 |
10 | 201021120111011 |
11 | 5906263a769242 |
12 | 1a6672a648aaab |
13 | 8822297004b15 |
14 | 378d68d00860b |
15 | 1839049a7b35b |
hex | b6d3e074e1a3 |
201021120111011 has 4 divisors (see below), whose sum is σ = 203011428231024. Its totient is φ = 199030811991000.
The previous prime is 201021120110887. The next prime is 201021120111023. The reversal of 201021120111011 is 110111021120102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 201021120111011 - 222 = 201021115916707 is a prime.
It is a super-2 number, since 2×2010211201110112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201021120161011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 995154059855 + ... + 995154060056.
It is an arithmetic number, because the mean of its divisors is an integer number (50752857057756).
Almost surely, 2201021120111011 is an apocalyptic number.
201021120111011 is a deficient number, since it is larger than the sum of its proper divisors (1990308120013).
201021120111011 is a wasteful number, since it uses less digits than its factorization.
201021120111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1990308120012.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 201021120111011 its reverse (110111021120102), we get a palindrome (311132141231113).
The spelling of 201021120111011 in words is "two hundred one trillion, twenty-one billion, one hundred twenty million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •