Base | Representation |
---|---|
bin | 101101011111111111000100… |
… | …001001011100111010110110 |
3 | 222020112100011202222022021011 |
4 | 231133333010021130322312 |
5 | 202212101002144200042 |
6 | 1545333152201542434 |
7 | 60102323060604265 |
oct | 5537770411347266 |
9 | 866470152868234 |
10 | 200110112100022 |
11 | 58841249469903 |
12 | 1a53a81b7a4a1a |
13 | 87873c1a77c57 |
14 | 375b549a685dc |
15 | 18204cae2ba17 |
hex | b5ffc425ceb6 |
200110112100022 has 8 divisors (see below), whose sum is σ = 300166758970056. Its totient is φ = 100054525776672.
The previous prime is 200110112100001. The next prime is 200110112100023. The reversal of 200110112100022 is 220001211011002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 200110112099975 and 200110112100011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200110112100023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 264664788 + ... + 265419799.
It is an arithmetic number, because the mean of its divisors is an integer number (37520844871257).
Almost surely, 2200110112100022 is an apocalyptic number.
200110112100022 is a deficient number, since it is larger than the sum of its proper divisors (100056646870034).
200110112100022 is a wasteful number, since it uses less digits than its factorization.
200110112100022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 530273342.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200110112100022 its reverse (220001211011002), we get a palindrome (420111323111024).
The spelling of 200110112100022 in words is "two hundred trillion, one hundred ten billion, one hundred twelve million, one hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •