Base | Representation |
---|---|
bin | 11001000010010101111111… |
… | …110000111011110101111011 |
3 | 112102212121212221110121220120 |
4 | 121002111333300323311323 |
5 | 103413034311321231021 |
6 | 1030104504450024323 |
7 | 32123226314611611 |
oct | 3102257760736573 |
9 | 472777787417816 |
10 | 110112220102011 |
11 | 320a336a69a856 |
12 | 1042459b8780a3 |
13 | 49596cb71a69a |
14 | 1d29661d156b1 |
15 | cae4116982c6 |
hex | 64257fc3bd7b |
110112220102011 has 64 divisors (see below), whose sum is σ = 159697316966400. Its totient is φ = 67248895130496.
The previous prime is 110112220101979. The next prime is 110112220102019. The reversal of 110112220102011 is 110201022211011.
It is a happy number.
It is not a de Polignac number, because 110112220102011 - 25 = 110112220101979 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110112220102019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 674530546 + ... + 674693768.
It is an arithmetic number, because the mean of its divisors is an integer number (2495270577600).
Almost surely, 2110112220102011 is an apocalyptic number.
110112220102011 is a deficient number, since it is larger than the sum of its proper divisors (49585096864389).
110112220102011 is a wasteful number, since it uses less digits than its factorization.
110112220102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165248.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 110112220102011 its reverse (110201022211011), we get a palindrome (220313242313022).
The spelling of 110112220102011 in words is "one hundred ten trillion, one hundred twelve billion, two hundred twenty million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •