Base | Representation |
---|---|
bin | 11101000111100110000… |
… | …110010100111110100111 |
3 | 21002021222112112221111210 |
4 | 131013212012110332213 |
5 | 230241042133223421 |
6 | 4131131143402503 |
7 | 264366101104335 |
oct | 35074606247647 |
9 | 7067875487453 |
10 | 2001020211111 |
11 | 70169a819569 |
12 | 283989753433 |
13 | 116906a29a9c |
14 | 6cbc817cb55 |
15 | 370b7852576 |
hex | 1d1e6194fa7 |
2001020211111 has 8 divisors (see below), whose sum is σ = 2668613474800. Its totient is φ = 1333720210752.
The previous prime is 2001020211109. The next prime is 2001020211149. The reversal of 2001020211111 is 1111120201002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2001020211111 - 21 = 2001020211109 is a prime.
It is a super-2 number, since 2×20010202111112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001020219111) 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 7 ways as a sum of consecutive naturals, for example, 73299910 + ... + 73327203.
It is an arithmetic number, because the mean of its divisors is an integer number (333576684350).
Almost surely, 22001020211111 is an apocalyptic number.
2001020211111 is a deficient number, since it is larger than the sum of its proper divisors (667593263689).
2001020211111 is a wasteful number, since it uses less digits than its factorization.
2001020211111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146631665.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 2001020211111 its reverse (1111120201002), we get a palindrome (3112140412113).
The spelling of 2001020211111 in words is "two trillion, one billion, twenty million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •