Base | Representation |
---|---|
bin | 11001000001000000010100… |
… | …001000011100001000001110 |
3 | 112102112211102022001202202012 |
4 | 121001000110020130020032 |
5 | 103410032402310323042 |
6 | 1025554331420501222 |
7 | 32113461421004156 |
oct | 3101002410341016 |
9 | 472484368052665 |
10 | 110020220011022 |
11 | 32068349a7a802 |
12 | 1040a7a50aa812 |
13 | 4950b2941b819 |
14 | 1d25015537766 |
15 | cabd2993be82 |
hex | 64101421c20e |
110020220011022 has 8 divisors (see below), whose sum is σ = 165248335738776. Its totient is φ = 54937441431432.
The previous prime is 110020220011007. The next prime is 110020220011027. The reversal of 110020220011022 is 220110022020011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1100202200110222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110020220010988 and 110020220011006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110020220011027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36334285148 + ... + 36334288175.
It is an arithmetic number, because the mean of its divisors is an integer number (20656041967347).
Almost surely, 2110020220011022 is an apocalyptic number.
110020220011022 is a deficient number, since it is larger than the sum of its proper divisors (55228115727754).
110020220011022 is an equidigital number, since it uses as much as digits as its factorization.
110020220011022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72668574082.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 110020220011022 its reverse (220110022020011), we get a palindrome (330130242031033).
The spelling of 110020220011022 in words is "one hundred ten trillion, twenty billion, two hundred twenty million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •