Base | Representation |
---|---|
bin | 11101010000111111011… |
… | …111111001010001101001 |
3 | 21010021000201022100112202 |
4 | 131100333133321101221 |
5 | 230422223131121301 |
6 | 4135520255145545 |
7 | 265204116055352 |
oct | 35207737712151 |
9 | 7107021270482 |
10 | 2011110020201 |
11 | 7059a81a4467 |
12 | 2859248152b5 |
13 | 117854200319 |
14 | 6d4a41dcd29 |
15 | 374a855066b |
hex | 1d43f7f9469 |
2011110020201 has 4 divisors (see below), whose sum is σ = 2011170261072. Its totient is φ = 2011049779332.
The previous prime is 2011110020137. The next prime is 2011110020209. The reversal of 2011110020201 is 1020200111102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2011110020201 - 26 = 2011110020137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2011110020209) 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, 30070331 + ... + 30137136.
It is an arithmetic number, because the mean of its divisors is an integer number (502792565268).
Almost surely, 22011110020201 is an apocalyptic number.
It is an amenable number.
2011110020201 is a deficient number, since it is larger than the sum of its proper divisors (60240871).
2011110020201 is an equidigital number, since it uses as much as digits as its factorization.
2011110020201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60240870.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2011110020201 its reverse (1020200111102), we get a palindrome (3031310131303).
Subtracting from 2011110020201 its reverse (1020200111102), we obtain a palindrome (990909909099).
The spelling of 2011110020201 in words is "two trillion, eleven billion, one hundred ten million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •