Base | Representation |
---|---|
bin | 101101011110011000100111… |
… | …100101010100111110100011 |
3 | 222020010211020121212201022211 |
4 | 231132120213211110332203 |
5 | 202203300211431432321 |
6 | 1545210441020542551 |
7 | 60061350125444305 |
oct | 5536304745247643 |
9 | 866124217781284 |
10 | 200000111202211 |
11 | 587a9630866201 |
12 | 1a5214406b1a57 |
13 | 8779c113254c8 |
14 | 37560b26cd975 |
15 | 181c6ddc080e1 |
hex | b5e627954fa3 |
200000111202211 has 8 divisors (see below), whose sum is σ = 202253268468240. Its totient is φ = 197747086492032.
The previous prime is 200000111202107. The next prime is 200000111202253. The reversal of 200000111202211 is 112202111000002.
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 200000111202211 - 247 = 59262622846883 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200000111202191 and 200000111202200.
It is not an unprimeable number, because it can be changed into a prime (200000111202011) 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, 30102810 + ... + 36141103.
It is an arithmetic number, because the mean of its divisors is an integer number (25281658558530).
Almost surely, 2200000111202211 is an apocalyptic number.
200000111202211 is a deficient number, since it is larger than the sum of its proper divisors (2253157266029).
200000111202211 is an equidigital number, since it uses as much as digits as its factorization.
200000111202211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66277925.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200000111202211 its reverse (112202111000002), we get a palindrome (312202222202213).
The spelling of 200000111202211 in words is "two hundred trillion, one hundred eleven million, two hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •