Base | Representation |
---|---|
bin | 1001001100100110111011… |
… | …0000000100100011011111 |
3 | 1022210201101101020021001112 |
4 | 2103021232300010203133 |
5 | 2311134302021010421 |
6 | 33301252522332235 |
7 | 2062404006136025 |
oct | 223115660044337 |
9 | 38721341207045 |
10 | 10112211110111 |
11 | 3249623601960 |
12 | 117399305a07b |
13 | 5847677769b6 |
14 | 26d60dc42715 |
15 | 1280961ee45b |
hex | 9326ec048df |
10112211110111 has 16 divisors (see below), whose sum is σ = 11053143335808. Its totient is φ = 9174891660000.
The previous prime is 10112211110021. The next prime is 10112211110117. The reversal of 10112211110111 is 11101111221101.
It is not a de Polignac number, because 10112211110111 - 222 = 10112206915807 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10112211110117) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 33919280 + ... + 34216106.
It is an arithmetic number, because the mean of its divisors is an integer number (690821458488).
Almost surely, 210112211110111 is an apocalyptic number.
10112211110111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10112211110111 is a deficient number, since it is larger than the sum of its proper divisors (940932225697).
10112211110111 is a wasteful number, since it uses less digits than its factorization.
10112211110111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 302902.
The product of its (nonzero) digits is 4, while the sum is 14.
Adding to 10112211110111 its reverse (11101111221101), we get a palindrome (21213322331212).
It can be divided in two parts, 1011 and 2211110111, that added together give a palindrome (2211111122).
The spelling of 10112211110111 in words is "ten trillion, one hundred twelve billion, two hundred eleven million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •