Base | Representation |
---|---|
bin | 11001001111101100110111… |
… | …100101101101101001111111 |
3 | 112120010101011211000200011201 |
4 | 121033230313211231221333 |
5 | 104023104202320431421 |
6 | 1032050312200000331 |
7 | 32246443115666413 |
oct | 3117546745555177 |
9 | 476111154020151 |
10 | 111030132202111 |
11 | 32417684095561 |
12 | 105524727600a7 |
13 | 49c513413bc95 |
14 | 1d5bc5c1a6d43 |
15 | cc82364b8b91 |
hex | 64fb3796da7f |
111030132202111 has 8 divisors (see below), whose sum is σ = 117561438259920. Its totient is φ = 104498839678848.
The previous prime is 111030132202037. The next prime is 111030132202163. The reversal of 111030132202111 is 111202231030111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 111030132202111 - 229 = 111029595331199 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 (111030132202181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17021845 + ... + 22623073.
It is an arithmetic number, because the mean of its divisors is an integer number (14695179782490).
Almost surely, 2111030132202111 is an apocalyptic number.
111030132202111 is a deficient number, since it is larger than the sum of its proper divisors (6531306057809).
111030132202111 is a wasteful number, since it uses less digits than its factorization.
111030132202111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6767273.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 111030132202111 its reverse (111202231030111), we get a palindrome (222232363232222).
The spelling of 111030132202111 in words is "one hundred eleven trillion, thirty billion, one hundred thirty-two million, two hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.426 sec. • engine limits •