Base | Representation |
---|---|
bin | 101101011110101011010100… |
… | …111110011110001101111011 |
3 | 222020012202002122201112111212 |
4 | 231132223110332132031323 |
5 | 202204112332212334321 |
6 | 1545224002244113335 |
7 | 60062661010442261 |
oct | 5536532476361573 |
9 | 866182078645455 |
10 | 200020200121211 |
11 | 588070aa4a83a8 |
12 | 1a52530839584b |
13 | 877ba93264022 |
14 | 375705a720431 |
15 | 181ceb768a55b |
hex | b5ead4f9e37b |
200020200121211 has 4 divisors (see below), whose sum is σ = 204898741587624. Its totient is φ = 195141658654800.
The previous prime is 200020200121207. The next prime is 200020200121213. The reversal of 200020200121211 is 112121002020002.
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 200020200121211 - 22 = 200020200121207 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200020200121213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2439270733145 + ... + 2439270733226.
It is an arithmetic number, because the mean of its divisors is an integer number (51224685396906).
Almost surely, 2200020200121211 is an apocalyptic number.
200020200121211 is a deficient number, since it is larger than the sum of its proper divisors (4878541466413).
200020200121211 is an equidigital number, since it uses as much as digits as its factorization.
200020200121211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4878541466412.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 200020200121211 its reverse (112121002020002), we get a palindrome (312141202141213).
The spelling of 200020200121211 in words is "two hundred trillion, twenty billion, two hundred million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •