Base | Representation |
---|---|
bin | 11001000010011110010001… |
… | …110000111000000100001110 |
3 | 112102220110211122011101221221 |
4 | 121002132101300320010032 |
5 | 103413211014133323042 |
6 | 1030112535050313554 |
7 | 32123662545601600 |
oct | 3102362160700416 |
9 | 472813748141857 |
10 | 110121112011022 |
11 | 320a7112973692 |
12 | 104262617288ba |
13 | 495a4b79834c8 |
14 | 1d29c66c31170 |
15 | cae782122d67 |
hex | 642791c3810e |
110121112011022 has 24 divisors (see below), whose sum is σ = 198775969257960. Its totient is φ = 45567356693040.
The previous prime is 110121112011007. The next prime is 110121112011023. The reversal of 110121112011022 is 220110211121011.
It is a junction number, because it is equal to n+sod(n) for n = 110121112010987 and 110121112011005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110121112011023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19373873304 + ... + 19373878987.
It is an arithmetic number, because the mean of its divisors is an integer number (8282332052415).
Almost surely, 2110121112011022 is an apocalyptic number.
110121112011022 is a deficient number, since it is larger than the sum of its proper divisors (88654857246938).
110121112011022 is a wasteful number, since it uses less digits than its factorization.
110121112011022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38747752336 (or 38747752329 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 110121112011022 its reverse (220110211121011), we get a palindrome (330231323132033).
The spelling of 110121112011022 in words is "one hundred ten trillion, one hundred twenty-one billion, one hundred twelve million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •