Base | Representation |
---|---|
bin | 110100001100111001… |
… | …1001111000011100110 |
3 | 101201100120201012112102 |
4 | 1220121303033003212 |
5 | 3314041103323420 |
6 | 123255435052102 |
7 | 11045664241505 |
oct | 1503163170346 |
9 | 351316635472 |
10 | 112102011110 |
11 | 435a6732181 |
12 | 198868a1032 |
13 | a756b4026b |
14 | 55d643483c |
15 | 2db190aa75 |
hex | 1a19ccf0e6 |
112102011110 has 32 divisors (see below), whose sum is σ = 208833249600. Its totient is φ = 43275576960.
The previous prime is 112102011097. The next prime is 112102011221. The reversal of 112102011110 is 11110201211.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 112102011091 and 112102011100.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 586556 + ... + 753824.
It is an arithmetic number, because the mean of its divisors is an integer number (6526039050).
Almost surely, 2112102011110 is an apocalyptic number.
112102011110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112102011110 is a deficient number, since it is larger than the sum of its proper divisors (96731238490).
112102011110 is a wasteful number, since it uses less digits than its factorization.
112102011110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169616.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 112102011110 its reverse (11110201211), we get a palindrome (123212212321).
The spelling of 112102011110 in words is "one hundred twelve billion, one hundred two million, eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •