Base | Representation |
---|---|
bin | 101101110000000000011100… |
… | …001001011100001111001011 |
3 | 222101102121000112011200121211 |
4 | 231300000130021130033023 |
5 | 202333120313112320021 |
6 | 1551535034152113551 |
7 | 60245010430425502 |
oct | 5560003411341713 |
9 | 871377015150554 |
10 | 201211100120011 |
11 | 5912616a500943 |
12 | 1a6980863958b7 |
13 | 8837182457527 |
14 | 3798952441839 |
15 | 183de684e43e1 |
hex | b7001c25c3cb |
201211100120011 has 4 divisors (see below), whose sum is σ = 213047047185912. Its totient is φ = 189375153054112.
The previous prime is 201211100119919. The next prime is 201211100120021. The reversal of 201211100120011 is 110021001112102.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 201211100120011 - 239 = 200661344306123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201211100119973 and 201211100120000.
It is not an unprimeable number, because it can be changed into a prime (201211100120021) 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, 5917973532925 + ... + 5917973532958.
It is an arithmetic number, because the mean of its divisors is an integer number (53261761796478).
Almost surely, 2201211100120011 is an apocalyptic number.
201211100120011 is a deficient number, since it is larger than the sum of its proper divisors (11835947065901).
201211100120011 is a wasteful number, since it uses less digits than its factorization.
201211100120011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11835947065900.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 201211100120011 its reverse (110021001112102), we get a palindrome (311232101232113).
The spelling of 201211100120011 in words is "two hundred one trillion, two hundred eleven billion, one hundred million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.139 sec. • engine limits •