Base | Representation |
---|---|
bin | 11001010000111010001010… |
… | …101001010011011111111111 |
3 | 112120102022102002002020110002 |
4 | 121100322022221103133333 |
5 | 104030434142241443403 |
6 | 1032152400043304515 |
7 | 32255441641622264 |
oct | 3120721251233777 |
9 | 476368362066402 |
10 | 111113130031103 |
11 | 324498a5209962 |
12 | 1056657651b13b |
13 | 49ccc003780b5 |
14 | 1d61c9314126b |
15 | cca492c4d188 |
hex | 650e8aa537ff |
111113130031103 has 2 divisors, whose sum is σ = 111113130031104. Its totient is φ = 111113130031102.
The previous prime is 111113130031069. The next prime is 111113130031117. The reversal of 111113130031103 is 301130031311111.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (301130031311111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111113130031103 - 212 = 111113130027007 is a prime.
It is a super-2 number, since 2×1111131300311032 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111113130031003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55556565015551 + 55556565015552.
It is an arithmetic number, because the mean of its divisors is an integer number (55556565015552).
Almost surely, 2111113130031103 is an apocalyptic number.
111113130031103 is a deficient number, since it is larger than the sum of its proper divisors (1).
111113130031103 is an equidigital number, since it uses as much as digits as its factorization.
111113130031103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 20.
Adding to 111113130031103 its reverse (301130031311111), we get a palindrome (412243161342214).
The spelling of 111113130031103 in words is "one hundred eleven trillion, one hundred thirteen billion, one hundred thirty million, thirty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •