Base | Representation |
---|---|
bin | 110011110000001110… |
… | …1111000001100110001 |
3 | 101121212112201121212002 |
4 | 1213200131320030301 |
5 | 3310103332024103 |
6 | 123020154143345 |
7 | 11013104233451 |
oct | 1474035701461 |
9 | 347775647762 |
10 | 111140111153 |
11 | 43152771535 |
12 | 19658721b55 |
13 | a632782ba6 |
14 | 55447a3d61 |
15 | 2d57253488 |
hex | 19e0778331 |
111140111153 has 2 divisors, whose sum is σ = 111140111154. Its totient is φ = 111140111152.
The previous prime is 111140111113. The next prime is 111140111171. The reversal of 111140111153 is 351111041111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109132443904 + 2007667249 = 330352^2 + 44807^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111140111153 is a prime.
It is a super-3 number, since 3×1111401111533 (a number of 34 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (111140111113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55570055576 + 55570055577.
It is an arithmetic number, because the mean of its divisors is an integer number (55570055577).
Almost surely, 2111140111153 is an apocalyptic number.
It is an amenable number.
111140111153 is a deficient number, since it is larger than the sum of its proper divisors (1).
111140111153 is an equidigital number, since it uses as much as digits as its factorization.
111140111153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 60, while the sum is 20.
Adding to 111140111153 its reverse (351111041111), we get a palindrome (462251152264).
The spelling of 111140111153 in words is "one hundred eleven billion, one hundred forty million, one hundred eleven thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •