Base | Representation |
---|---|
bin | 11101000110101001111… |
… | …100111101011000011001 |
3 | 21002012101012202220202110 |
4 | 131012221330331120121 |
5 | 230232010321402301 |
6 | 4130443055222533 |
7 | 264332066020221 |
oct | 35065174753031 |
9 | 7065335686673 |
10 | 2000011122201 |
11 | 701222158094 |
12 | 283747817a49 |
13 | 1167a5959961 |
14 | 6cb30147081 |
15 | 37058e780d6 |
hex | 1d1a9f3d619 |
2000011122201 has 8 divisors (see below), whose sum is σ = 2666689717824. Its totient is φ = 1333336637360.
The previous prime is 2000011122191. The next prime is 2000011122281. The reversal of 2000011122201 is 1022211100002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2000011122201 - 25 = 2000011122169 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2000011122281) 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, 384931 + ... + 2036711.
It is an arithmetic number, because the mean of its divisors is an integer number (333336214728).
Almost surely, 22000011122201 is an apocalyptic number.
It is an amenable number.
2000011122201 is a deficient number, since it is larger than the sum of its proper divisors (666678595623).
2000011122201 is a wasteful number, since it uses less digits than its factorization.
2000011122201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2055391.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2000011122201 its reverse (1022211100002), we get a palindrome (3022222222203).
It can be divided in two parts, 2000011 and 122201, that added together give a palindrome (2122212).
The spelling of 2000011122201 in words is "two trillion, eleven million, one hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.148 sec. • engine limits •