Base | Representation |
---|---|
bin | 110011101111011011… |
… | …1010000100010011011 |
3 | 101121210200002220102111 |
4 | 1213132313100202123 |
5 | 3310024440210021 |
6 | 123013353413151 |
7 | 11012326462456 |
oct | 1473667204233 |
9 | 347720086374 |
10 | 111113210011 |
11 | 43139568291 |
12 | 1964b70a1b7 |
13 | a62a02455b |
14 | 5540da049d |
15 | 2d54bdc8e1 |
hex | 19dedd089b |
111113210011 has 2 divisors, whose sum is σ = 111113210012. Its totient is φ = 111113210010.
The previous prime is 111113210003. The next prime is 111113210027. The reversal of 111113210011 is 110012311111.
It is a weak prime.
It is an emirp because it is prime and its reverse (110012311111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111113210011 - 23 = 111113210003 is a prime.
It is a super-2 number, since 2×1111132100112 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111113209973 and 111113210000.
It is not a weakly prime, because it can be changed into another prime (111113210041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55556605005 + 55556605006.
It is an arithmetic number, because the mean of its divisors is an integer number (55556605006).
Almost surely, 2111113210011 is an apocalyptic number.
111113210011 is a deficient number, since it is larger than the sum of its proper divisors (1).
111113210011 is an equidigital number, since it uses as much as digits as its factorization.
111113210011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 111113210011 its reverse (110012311111), we get a palindrome (221125521122).
The spelling of 111113210011 in words is "one hundred eleven billion, one hundred thirteen million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •