Base | Representation |
---|---|
bin | 11001000011100111101111… |
… | …111111001000111111101011 |
3 | 112110012000110122000020220010 |
4 | 121003213233333020333223 |
5 | 103421004101032020021 |
6 | 1030213103201303003 |
7 | 32132454533401104 |
oct | 3103475777107753 |
9 | 473160418006803 |
10 | 110200002220011 |
11 | 32127616388310 |
12 | 104395b9934a63 |
13 | 4964a7abb9c42 |
14 | 1d2d9cc43d3ab |
15 | cb184ce74976 |
hex | 6439effc8feb |
110200002220011 has 32 divisors (see below), whose sum is σ = 163977382103040. Its totient is φ = 65268638265600.
The previous prime is 110200002219997. The next prime is 110200002220031. The reversal of 110200002220011 is 110022200002011.
It is not a de Polignac number, because 110200002220011 - 219 = 110200001695723 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110200002220031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 209577435 + ... + 210102596.
It is an arithmetic number, because the mean of its divisors is an integer number (5124293190720).
Almost surely, 2110200002220011 is an apocalyptic number.
110200002220011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110200002220011 is a deficient number, since it is larger than the sum of its proper divisors (53777379883029).
110200002220011 is a wasteful number, since it uses less digits than its factorization.
110200002220011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419680227.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 110200002220011 its reverse (110022200002011), we get a palindrome (220222202222022).
The spelling of 110200002220011 in words is "one hundred ten trillion, two hundred billion, two million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •