Base | Representation |
---|---|
bin | 11001000011111010011001… |
… | …001001101110000100101011 |
3 | 112110020221010201101121112020 |
4 | 121003322121021232010223 |
5 | 103421321100133241021 |
6 | 1030230213412315523 |
7 | 32134063564461603 |
oct | 3103723111560453 |
9 | 473227121347466 |
10 | 110220020212011 |
11 | 32135058a85a56 |
12 | 10441465912ba3 |
13 | 496691b224018 |
14 | 1d3096ac89c03 |
15 | cb21205967c6 |
hex | 643e9926e12b |
110220020212011 has 16 divisors (see below), whose sum is σ = 155496292506240. Its totient is φ = 69251957061120.
The previous prime is 110220020212009. The next prime is 110220020212033. The reversal of 110220020212011 is 110212020022011.
It is not a de Polignac number, because 110220020212011 - 21 = 110220020212009 is a prime.
It is a super-2 number, since 2×1102200202120112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110220020212051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5009534505 + ... + 5009556506.
It is an arithmetic number, because the mean of its divisors is an integer number (9718518281640).
Almost surely, 2110220020212011 is an apocalyptic number.
110220020212011 is a deficient number, since it is larger than the sum of its proper divisors (45276272294229).
110220020212011 is a wasteful number, since it uses less digits than its factorization.
110220020212011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10019091226.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 110220020212011 its reverse (110212020022011), we get a palindrome (220432040234022).
The spelling of 110220020212011 in words is "one hundred ten trillion, two hundred twenty billion, twenty million, two hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •