Base | Representation |
---|---|
bin | 1010000110110011110101… |
… | …1100001101101101101101 |
3 | 1110100022022010122210012001 |
4 | 2201230331130031231231 |
5 | 2424030100431414013 |
6 | 35344500003412301 |
7 | 2224552321522165 |
oct | 241547534155555 |
9 | 43308263583161 |
10 | 11112111201133 |
11 | 35a4690098748 |
12 | 12b5727684091 |
13 | 627b381312a7 |
14 | 2a5b86cbd5a5 |
15 | 1440b8cccddd |
hex | a1b3d70db6d |
11112111201133 has 2 divisors, whose sum is σ = 11112111201134. Its totient is φ = 11112111201132.
The previous prime is 11112111201127. The next prime is 11112111201281. The reversal of 11112111201133 is 33110211121111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10184536107684 + 927575093449 = 3191322^2 + 963107^2 .
It is a cyclic number.
It is not a de Polignac number, because 11112111201133 - 25 = 11112111201101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11112111201133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11112111201533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5556055600566 + 5556055600567.
It is an arithmetic number, because the mean of its divisors is an integer number (5556055600567).
Almost surely, 211112111201133 is an apocalyptic number.
It is an amenable number.
11112111201133 is a deficient number, since it is larger than the sum of its proper divisors (1).
11112111201133 is an equidigital number, since it uses as much as digits as its factorization.
11112111201133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 19.
Adding to 11112111201133 its reverse (33110211121111), we get a palindrome (44222322322244).
The spelling of 11112111201133 in words is "eleven trillion, one hundred twelve billion, one hundred eleven million, two hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •