Base | Representation |
---|---|
bin | 11001010000111001000111… |
… | …010110110100100010010011 |
3 | 112120102012111101211012212021 |
4 | 121100321013112310202103 |
5 | 104030424334241042321 |
6 | 1032152052034512311 |
7 | 32255401653152461 |
oct | 3120710726644223 |
9 | 476365441735767 |
10 | 111112001112211 |
11 | 32449375a42440 |
12 | 10566300435697 |
13 | 49cca80510558 |
14 | 1d61bc7235831 |
15 | cca428aa3941 |
hex | 650e475b4893 |
111112001112211 has 8 divisors (see below), whose sum is σ = 122575036978800. Its totient is φ = 99875956055040.
The previous prime is 111112001112143. The next prime is 111112001112271. The reversal of 111112001112211 is 112211100211111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 111112001112211 - 225 = 111111967557779 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111112001112271) 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, 56747701326 + ... + 56747703283.
It is an arithmetic number, because the mean of its divisors is an integer number (15321879622350).
Almost surely, 2111112001112211 is an apocalyptic number.
111112001112211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
111112001112211 is a deficient number, since it is larger than the sum of its proper divisors (11463035866589).
111112001112211 is a wasteful number, since it uses less digits than its factorization.
111112001112211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 113495404709.
The product of its (nonzero) digits is 8, while the sum is 16.
Adding to 111112001112211 its reverse (112211100211111), we get a palindrome (223323101323322).
The spelling of 111112001112211 in words is "one hundred eleven trillion, one hundred twelve billion, one million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •