Base | Representation |
---|---|
bin | 110110111111000100… |
… | …1101101100100001101 |
3 | 102021210020110120220111 |
4 | 1231332021231210031 |
5 | 3413312112422031 |
6 | 130125004520021 |
7 | 11350101321061 |
oct | 1557611554415 |
9 | 367706416814 |
10 | 118080592141 |
11 | 46094463636 |
12 | 1aa74b50011 |
13 | b19a649a85 |
14 | 5a02469aa1 |
15 | 31117121b1 |
hex | 1b7e26d90d |
118080592141 has 2 divisors, whose sum is σ = 118080592142. Its totient is φ = 118080592140.
The previous prime is 118080592051. The next prime is 118080592151. The reversal of 118080592141 is 141295080811.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97377698916 + 20702893225 = 312054^2 + 143885^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-118080592141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 118080592094 and 118080592103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (118080592151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 59040296070 + 59040296071.
It is an arithmetic number, because the mean of its divisors is an integer number (59040296071).
Almost surely, 2118080592141 is an apocalyptic number.
It is an amenable number.
118080592141 is a deficient number, since it is larger than the sum of its proper divisors (1).
118080592141 is an equidigital number, since it uses as much as digits as its factorization.
118080592141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23040, while the sum is 40.
The spelling of 118080592141 in words is "one hundred eighteen billion, eighty million, five hundred ninety-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •