Base | Representation |
---|---|
bin | 101101100001100111010111… |
… | …101111111101001000000011 |
3 | 222020221001021002222201100121 |
4 | 231201213113233331020003 |
5 | 202220414340142011321 |
6 | 1545500433444001111 |
7 | 60113366353151320 |
oct | 5541472757751003 |
9 | 866831232881317 |
10 | 200222110110211 |
11 | 588847a1417602 |
12 | 1a558477690197 |
13 | 8794b301a35b7 |
14 | 3762b32349b47 |
15 | 1823383642441 |
hex | b619d7bfd203 |
200222110110211 has 8 divisors (see below), whose sum is σ = 229068441147744. Its totient is φ = 171436572185280.
The previous prime is 200222110110089. The next prime is 200222110110251. The reversal of 200222110110211 is 112011011222002.
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 200222110110211 - 245 = 165037738021379 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200222110110251) 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, 15198271090 + ... + 15198284263.
It is an arithmetic number, because the mean of its divisors is an integer number (28633555143468).
Almost surely, 2200222110110211 is an apocalyptic number.
200222110110211 is a deficient number, since it is larger than the sum of its proper divisors (28846331037533).
200222110110211 is an equidigital number, since it uses as much as digits as its factorization.
200222110110211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30396556301.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 200222110110211 its reverse (112011011222002), we get a palindrome (312233121332213).
The spelling of 200222110110211 in words is "two hundred trillion, two hundred twenty-two billion, one hundred ten million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •