Base | Representation |
---|---|
bin | 11101000110101111110… |
… | …110111111011110011011 |
3 | 21002012122010020200001011 |
4 | 131012233312333132123 |
5 | 230232211204034321 |
6 | 4130500555234351 |
7 | 264334411240504 |
oct | 35065766773633 |
9 | 7065563220034 |
10 | 2000110221211 |
11 | 7012730936a3 |
12 | 283774a489b7 |
13 | 1167c034631b |
14 | 6cb3d381bab |
15 | 37062a00ae1 |
hex | 1d1afdbf79b |
2000110221211 has 8 divisors (see below), whose sum is σ = 2052635802464. Its totient is φ = 1948221313920.
The previous prime is 2000110221203. The next prime is 2000110221223. The reversal of 2000110221211 is 1121220110002.
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 2000110221211 - 23 = 2000110221203 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2000110221191 and 2000110221200.
It is not an unprimeable number, because it can be changed into a prime (2000110221251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 159162126 + ... + 159174691.
It is an arithmetic number, because the mean of its divisors is an integer number (256579475308).
Almost surely, 22000110221211 is an apocalyptic number.
2000110221211 is a deficient number, since it is larger than the sum of its proper divisors (52525581253).
2000110221211 is a wasteful number, since it uses less digits than its factorization.
2000110221211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318336981.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2000110221211 its reverse (1121220110002), we get a palindrome (3121330331213).
The spelling of 2000110221211 in words is "two trillion, one hundred ten million, two hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •