Base | Representation |
---|---|
bin | 11010110110110010000000… |
… | …111010101011011111011011 |
3 | 120111012120021021001002012201 |
4 | 122312302000322223133123 |
5 | 110440133441424144024 |
6 | 1055112414110351031 |
7 | 33610303111422502 |
oct | 3266620072533733 |
9 | 514176237032181 |
10 | 118113763506139 |
11 | 346a8847309395 |
12 | 112b72a44bb477 |
13 | 50ba106cbcc0b |
14 | 2124a45555839 |
15 | d9c623d7d744 |
hex | 6b6c80eab7db |
118113763506139 has 2 divisors, whose sum is σ = 118113763506140. Its totient is φ = 118113763506138.
The previous prime is 118113763506077. The next prime is 118113763506187. The reversal of 118113763506139 is 931605367311811.
It is a strong prime.
It is an emirp because it is prime and its reverse (931605367311811) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 118113763506139 - 215 = 118113763473371 is a prime.
It is a super-2 number, since 2×1181137635061392 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 118113763506139.
It is not a weakly prime, because it can be changed into another prime (118113763509139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 59056881753069 + 59056881753070.
It is an arithmetic number, because the mean of its divisors is an integer number (59056881753070).
Almost surely, 2118113763506139 is an apocalyptic number.
118113763506139 is a deficient number, since it is larger than the sum of its proper divisors (1).
118113763506139 is an equidigital number, since it uses as much as digits as its factorization.
118113763506139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2449440, while the sum is 55.
The spelling of 118113763506139 in words is "one hundred eighteen trillion, one hundred thirteen billion, seven hundred sixty-three million, five hundred six thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •