Base | Representation |
---|---|
bin | 11001000010001011100011… |
… | …000111101111001100011011 |
3 | 112102211112221010212012022211 |
4 | 121002023203013233030123 |
5 | 103412343323020401021 |
6 | 1030055411353455551 |
7 | 32122351320424555 |
oct | 3102134307571433 |
9 | 472745833765284 |
10 | 110101002122011 |
11 | 320996334093aa |
12 | 1042238aa115b7 |
13 | 49586315b1bb4 |
14 | 1d28cba1024d5 |
15 | cadea68ec3e1 |
hex | 6422e31ef31b |
110101002122011 has 8 divisors (see below), whose sum is σ = 115896075508800. Its totient is φ = 104305957115400.
The previous prime is 110101002122009. The next prime is 110101002122053. The reversal of 110101002122011 is 110221200101011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110101002122011 - 21 = 110101002122009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110101002121982 and 110101002122000.
It is not an unprimeable number, because it can be changed into a prime (110101002122311) 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, 1111560 + ... + 14880778.
It is an arithmetic number, because the mean of its divisors is an integer number (14487009438600).
Almost surely, 2110101002122011 is an apocalyptic number.
110101002122011 is a deficient number, since it is larger than the sum of its proper divisors (5795073386789).
110101002122011 is a wasteful number, since it uses less digits than its factorization.
110101002122011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14190089.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110101002122011 its reverse (110221200101011), we get a palindrome (220322202223022).
The spelling of 110101002122011 in words is "one hundred ten trillion, one hundred one billion, two million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •