Base | Representation |
---|---|
bin | 11001000011111010101010… |
… | …100011111101000110111011 |
3 | 112110020221220002000022200101 |
4 | 121003322222203331012323 |
5 | 103421322144422131021 |
6 | 1030230302405020231 |
7 | 32134104042265132 |
oct | 3103725243750673 |
9 | 473227802008611 |
10 | 110220312302011 |
11 | 3213519894754a |
12 | 104415276b4677 |
13 | 49669668b2642 |
14 | 1d309979a0919 |
15 | cb213b041a91 |
hex | 643eaa8fd1bb |
110220312302011 has 8 divisors (see below), whose sum is σ = 111291240812544. Its totient is φ = 109149399722280.
The previous prime is 110220312301997. The next prime is 110220312302017. The reversal of 110220312302011 is 110203213022011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110220312302011 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 110220312302011.
It is not an unprimeable number, because it can be changed into a prime (110220312302017) 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, 10164870 + ... + 17993476.
It is an arithmetic number, because the mean of its divisors is an integer number (13911405101568).
Almost surely, 2110220312302011 is an apocalyptic number.
110220312302011 is a deficient number, since it is larger than the sum of its proper divisors (1070928510533).
110220312302011 is a wasteful number, since it uses less digits than its factorization.
110220312302011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7965401.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 110220312302011 its reverse (110203213022011), we get a palindrome (220423525324022).
The spelling of 110220312302011 in words is "one hundred ten trillion, two hundred twenty billion, three hundred twelve million, three hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •