Base | Representation |
---|---|
bin | 1001001100100110100011… |
… | …0110110011010010100111 |
3 | 1022210201010111010200010121 |
4 | 2103021220312303102213 |
5 | 2311134101211223421 |
6 | 33301235030502411 |
7 | 2062401365410531 |
oct | 223115066632247 |
9 | 38721114120117 |
10 | 10112112211111 |
11 | 32495827a2649 |
12 | 1173965b04a07 |
13 | 58475012a391 |
14 | 26d600a5a851 |
15 | 12808c6b5d41 |
hex | 93268db34a7 |
10112112211111 has 8 divisors (see below), whose sum is σ = 10551808631520. Its totient is φ = 9672419071392.
The previous prime is 10112112211099. The next prime is 10112112211141. The reversal of 10112112211111 is 11111221121101.
10112112211111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10112112211111 - 219 = 10112111686823 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 (10112112211141) 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, 7109985 + ... + 8412853.
It is an arithmetic number, because the mean of its divisors is an integer number (1318976078940).
Almost surely, 210112112211111 is an apocalyptic number.
10112112211111 is a deficient number, since it is larger than the sum of its proper divisors (439696420409).
10112112211111 is a wasteful number, since it uses less digits than its factorization.
10112112211111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1640345.
The product of its (nonzero) digits is 8, while the sum is 16.
Adding to 10112112211111 its reverse (11111221121101), we get a palindrome (21223333332212).
The spelling of 10112112211111 in words is "ten trillion, one hundred twelve billion, one hundred twelve million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •