Base | Representation |
---|---|
bin | 11001000000110111111010… |
… | …100100000100000000000110 |
3 | 112102111222010202102010102211 |
4 | 121000313322210010000012 |
5 | 103404410414441010042 |
6 | 1025550240442254034 |
7 | 32113022055422152 |
oct | 3100677244040006 |
9 | 472458122363384 |
10 | 110011201110022 |
11 | 32064541049a13 |
12 | 10408aa87b731a |
13 | 495001ca81404 |
14 | 1d247db802062 |
15 | cab99cc7a017 |
hex | 640dfa904006 |
110011201110022 has 4 divisors (see below), whose sum is σ = 165016801665036. Its totient is φ = 55005600555010.
The previous prime is 110011201110007. The next prime is 110011201110059. The reversal of 110011201110022 is 220011102110011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a junction number, because it is equal to n+sod(n) for n = 110011201109984 and 110011201110011.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27502800277504 + ... + 27502800277507.
It is an arithmetic number, because the mean of its divisors is an integer number (41254200416259).
Almost surely, 2110011201110022 is an apocalyptic number.
110011201110022 is a deficient number, since it is larger than the sum of its proper divisors (55005600555014).
110011201110022 is an equidigital number, since it uses as much as digits as its factorization.
110011201110022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55005600555013.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110011201110022 its reverse (220011102110011), we get a palindrome (330022303220033).
The spelling of 110011201110022 in words is "one hundred ten trillion, eleven billion, two hundred one million, one hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •