Base | Representation |
---|---|
bin | 11001000011111010100100… |
… | …100101011010001111110011 |
3 | 112110020221122002022110220122 |
4 | 121003322210211122033303 |
5 | 103421321443234121321 |
6 | 1030230244423400455 |
7 | 32134101414020306 |
oct | 3103724445321763 |
9 | 473227562273818 |
10 | 110220212020211 |
11 | 32135147283327 |
12 | 104414b9bb312b |
13 | 496694bba07b7 |
14 | 1d30988538b3d |
15 | cb21323338ab |
hex | 643ea495a3f3 |
110220212020211 has 4 divisors (see below), whose sum is σ = 110221313848632. Its totient is φ = 110219110191792.
The previous prime is 110220212020189. The next prime is 110220212020253. The reversal of 110220212020211 is 112020212022011.
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 110220212020211 - 214 = 110220212003827 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 110220212020211.
It is not an unprimeable number, because it can be changed into a prime (110220212520211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 550764146 + ... + 550964231.
It is an arithmetic number, because the mean of its divisors is an integer number (27555328462158).
Almost surely, 2110220212020211 is an apocalyptic number.
110220212020211 is a deficient number, since it is larger than the sum of its proper divisors (1101828421).
110220212020211 is a wasteful number, since it uses less digits than its factorization.
110220212020211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1101828420.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 110220212020211 its reverse (112020212022011), we get a palindrome (222240424042222).
The spelling of 110220212020211 in words is "one hundred ten trillion, two hundred twenty billion, two hundred twelve million, twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •