Base | Representation |
---|---|
bin | 11001000000110111110100… |
… | …100110100101111011111100 |
3 | 112102111221212210020121012202 |
4 | 121000313310212211323330 |
5 | 103404410213341010022 |
6 | 1025550222511051032 |
7 | 32113016432430014 |
oct | 3100676446457374 |
9 | 472457783217182 |
10 | 110011101110012 |
11 | 3206449a658483 |
12 | 10408a7b210a78 |
13 | 495000513a8cb |
14 | 1d247cc410c44 |
15 | cab9940c5592 |
hex | 640df49a5efc |
110011101110012 has 24 divisors (see below), whose sum is σ = 195989208145920. Its totient is φ = 54016153450160.
The previous prime is 110011101110011. The next prime is 110011101110041. The reversal of 110011101110012 is 210011101110011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 110011101109975 and 110011101110002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110011101110011) 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, 245895164 + ... + 246342147.
It is an arithmetic number, because the mean of its divisors is an integer number (8166217006080).
Almost surely, 2110011101110012 is an apocalyptic number.
It is an amenable number.
110011101110012 is a deficient number, since it is larger than the sum of its proper divisors (85978107035908).
110011101110012 is a wasteful number, since it uses less digits than its factorization.
110011101110012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 492238321 (or 492238319 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 110011101110012 its reverse (210011101110011), we get a palindrome (320022202220023).
Subtracting 110011101110012 from its reverse (210011101110011), we obtain a palindrome (99999999999999).
The spelling of 110011101110012 in words is "one hundred ten trillion, eleven billion, one hundred one million, one hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •