Base | Representation |
---|---|
bin | 11001000011100111110111… |
… | …000100010010111111111110 |
3 | 112110012000202220112112011122 |
4 | 121003213313010102333332 |
5 | 103421004321434342342 |
6 | 1030213123043350542 |
7 | 32132460505202063 |
oct | 3103476704227776 |
9 | 473160686475148 |
10 | 110200121012222 |
11 | 3212767744469a |
12 | 10439631682452 |
13 | 4964a996b01a7 |
14 | 1d2da00122c6a |
15 | cb18585dc4d2 |
hex | 6439f7112ffe |
110200121012222 has 4 divisors (see below), whose sum is σ = 165300181518336. Its totient is φ = 55100060506110.
The previous prime is 110200121012203. The next prime is 110200121012227. The reversal of 110200121012222 is 222210121002011.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1102001210122222 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 110200121012222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110200121012227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27550030253054 + ... + 27550030253057.
It is an arithmetic number, because the mean of its divisors is an integer number (41325045379584).
Almost surely, 2110200121012222 is an apocalyptic number.
110200121012222 is a deficient number, since it is larger than the sum of its proper divisors (55100060506114).
110200121012222 is an equidigital number, since it uses as much as digits as its factorization.
110200121012222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55100060506113.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 110200121012222 its reverse (222210121002011), we get a palindrome (332410242014233).
The spelling of 110200121012222 in words is "one hundred ten trillion, two hundred billion, one hundred twenty-one million, twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •