Base | Representation |
---|---|
bin | 11001000011110010001100… |
… | …000001111000101101010110 |
3 | 112110020002101201122120022221 |
4 | 121003302030001320231112 |
5 | 103421200024242320042 |
6 | 1030222155253412554 |
7 | 32133332346103324 |
oct | 3103621401705526 |
9 | 473202351576287 |
10 | 110211210120022 |
11 | 32131347a044a0 |
12 | 1043b80733a15a |
13 | 4965b45c0663b |
14 | 1d30372b8ad14 |
15 | cb1ca6dcdd67 |
hex | 643c8c078b56 |
110211210120022 has 8 divisors (see below), whose sum is σ = 180345616560072. Its totient is φ = 50096004600000.
The previous prime is 110211210120019. The next prime is 110211210120029. The reversal of 110211210120022 is 220021012112011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1102112101200222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110211210119978 and 110211210120005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110211210120029) 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, 2504800229979 + ... + 2504800230022.
It is an arithmetic number, because the mean of its divisors is an integer number (22543202070009).
Almost surely, 2110211210120022 is an apocalyptic number.
110211210120022 is a deficient number, since it is larger than the sum of its proper divisors (70134406440050).
110211210120022 is a wasteful number, since it uses less digits than its factorization.
110211210120022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5009600460014.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 110211210120022 its reverse (220021012112011), we get a palindrome (330232222232033).
The spelling of 110211210120022 in words is "one hundred ten trillion, two hundred eleven billion, two hundred ten million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •