Base | Representation |
---|---|
bin | 110010000011000001100110… |
… | …010010000111010111100011 |
3 | 1001212100022220021212010000211 |
4 | 302003001212102013113203 |
5 | 212322241142200311321 |
6 | 2100045121400154551 |
7 | 64235302643066140 |
oct | 6203014622072743 |
9 | 1055308807763024 |
10 | 220110200010211 |
11 | 64152236710095 |
12 | 2082a9b8768a57 |
13 | 95a83c232b644 |
14 | 3c4d56784b3c7 |
15 | 1a6a88887a0e1 |
hex | c830664875e3 |
220110200010211 has 8 divisors (see below), whose sum is σ = 251567703487584. Its totient is φ = 188655993830400.
The previous prime is 220110200010161. The next prime is 220110200010257. The reversal of 220110200010211 is 112010002011022.
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 220110200010211 - 231 = 220108052526563 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220110200010191 and 220110200010200.
It is not an unprimeable number, because it can be changed into a prime (220110200013211) 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, 824181340 + ... + 824448361.
It is an arithmetic number, because the mean of its divisors is an integer number (31445962935948).
Almost surely, 2220110200010211 is an apocalyptic number.
220110200010211 is a deficient number, since it is larger than the sum of its proper divisors (31457503477373).
220110200010211 is a wasteful number, since it uses less digits than its factorization.
220110200010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1648648781.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 220110200010211 its reverse (112010002011022), we get a palindrome (332120202021233).
The spelling of 220110200010211 in words is "two hundred twenty trillion, one hundred ten billion, two hundred million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •