Base | Representation |
---|---|
bin | 101101011110100011110011… |
… | …011011111000000011100111 |
3 | 222020011222020121211101022021 |
4 | 231132203303123320003213 |
5 | 202203444311012223421 |
6 | 1545220144445044011 |
7 | 60062253551025436 |
oct | 5536436333700347 |
9 | 866158217741267 |
10 | 200012121211111 |
11 | 588037341336a0 |
12 | 1a523832856607 |
13 | 877b0a6582951 |
14 | 37568d179511d |
15 | 181cb932a4341 |
hex | b5e8f36f80e7 |
200012121211111 has 8 divisors (see below), whose sum is σ = 219860652325248. Its totient is φ = 180441191931000.
The previous prime is 200012121211099. The next prime is 200012121211151. The reversal of 200012121211111 is 111112121210002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200012121211111 - 27 = 200012121210983 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200012121211151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 69400456995 + ... + 69400459876.
It is an arithmetic number, because the mean of its divisors is an integer number (27482581540656).
Almost surely, 2200012121211111 is an apocalyptic number.
200012121211111 is a deficient number, since it is larger than the sum of its proper divisors (19848531114137).
200012121211111 is a wasteful number, since it uses less digits than its factorization.
200012121211111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 138800917013.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 200012121211111 its reverse (111112121210002), we get a palindrome (311124242421113).
It can be divided in two parts, 2000121 and 21211111, that added together give a palindrome (23211232).
The spelling of 200012121211111 in words is "two hundred trillion, twelve billion, one hundred twenty-one million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •