Base | Representation |
---|---|
bin | 1010000110110011111000… |
… | …0010000001010101000001 |
3 | 1110100022022211022022011111 |
4 | 2201230332002001111001 |
5 | 2424030111001034443 |
6 | 35344501000043321 |
7 | 2224552502000365 |
oct | 241547602012501 |
9 | 43308284268144 |
10 | 11112121111873 |
11 | 35a4695747841 |
12 | 12b572aa63541 |
13 | 627b3a1c1332 |
14 | 2a5b8833d2a5 |
15 | 1440b9ad969d |
hex | a1b3e081541 |
11112121111873 has 2 divisors, whose sum is σ = 11112121111874. Its totient is φ = 11112121111872.
The previous prime is 11112121111853. The next prime is 11112121111907. The reversal of 11112121111873 is 37811112121111.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5966065157809 + 5146055954064 = 2442553^2 + 2268492^2 .
It is a cyclic number.
It is not a de Polignac number, because 11112121111873 - 25 = 11112121111841 is a prime.
It is not a weakly prime, because it can be changed into another prime (11112121111843) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5556060555936 + 5556060555937.
It is an arithmetic number, because the mean of its divisors is an integer number (5556060555937).
Almost surely, 211112121111873 is an apocalyptic number.
It is an amenable number.
11112121111873 is a deficient number, since it is larger than the sum of its proper divisors (1).
11112121111873 is an equidigital number, since it uses as much as digits as its factorization.
11112121111873 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 672, while the sum is 31.
Adding to 11112121111873 its reverse (37811112121111), we get a palindrome (48923233232984).
The spelling of 11112121111873 in words is "eleven trillion, one hundred twelve billion, one hundred twenty-one million, one hundred eleven thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •