Base | Representation |
---|---|
bin | 11001000011111010100011… |
… | …111011011100101001110110 |
3 | 112110020221121022121121111020 |
4 | 121003322203323130221312 |
5 | 103421321432430120042 |
6 | 1030230243351522010 |
7 | 32134101221353632 |
oct | 3103724373345166 |
9 | 473227538547436 |
10 | 110220201020022 |
11 | 3213514104a765 |
12 | 104414b6389306 |
13 | 496694981b902 |
14 | 1d30986cb3dc2 |
15 | cb21313ae3ec |
hex | 643ea3edca76 |
110220201020022 has 16 divisors (see below), whose sum is σ = 221259883091760. Its totient is φ = 36603486831392.
The previous prime is 110220201020009. The next prime is 110220201020023. The reversal of 110220201020022 is 220020102022011.
It is a junction number, because it is equal to n+sod(n) for n = 110220201019983 and 110220201020010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110220201020023) 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, 34145042073 + ... + 34145045300.
It is an arithmetic number, because the mean of its divisors is an integer number (13828742693235).
Almost surely, 2110220201020022 is an apocalyptic number.
110220201020022 is an abundant number, since it is smaller than the sum of its proper divisors (111039682071738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110220201020022 is a wasteful number, since it uses less digits than its factorization.
110220201020022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68290087647.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 110220201020022 its reverse (220020102022011), we get a palindrome (330240303042033).
The spelling of 110220201020022 in words is "one hundred ten trillion, two hundred twenty billion, two hundred one million, twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •