Base | Representation |
---|---|
bin | 11101000111101010111… |
… | …010100101110000110011 |
3 | 21002022012011121110202102 |
4 | 131013222322211300303 |
5 | 230241223330121321 |
6 | 4131143151411015 |
7 | 264401102010356 |
oct | 35075272456063 |
9 | 7068164543672 |
10 | 2001101020211 |
11 | 7017313a2647 |
12 | 2839b0823a6b |
13 | 11691a6b1517 |
14 | 6cbd4bb629d |
15 | 370be9b5c0b |
hex | 1d1eaea5c33 |
2001101020211 has 4 divisors (see below), whose sum is σ = 2001156239472. Its totient is φ = 2001045800952.
The previous prime is 2001101020157. The next prime is 2001101020267. The reversal of 2001101020211 is 1120201011002.
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 2001101020211 - 26 = 2001101020147 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2001101020192 and 2001101020201.
It is not an unprimeable number, because it can be changed into a prime (2001101022211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27555236 + ... + 27627761.
It is an arithmetic number, because the mean of its divisors is an integer number (500289059868).
Almost surely, 22001101020211 is an apocalyptic number.
2001101020211 is a deficient number, since it is larger than the sum of its proper divisors (55219261).
2001101020211 is an equidigital number, since it uses as much as digits as its factorization.
2001101020211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55219260.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2001101020211 its reverse (1120201011002), we get a palindrome (3121302031213).
The spelling of 2001101020211 in words is "two trillion, one billion, one hundred one million, twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •