Base | Representation |
---|---|
bin | 1110000101010… |
… | …00011001110101 |
3 | 22020021122022001 |
4 | 13002220121311 |
5 | 220220132133 |
6 | 15415535301 |
7 | 2633043121 |
oct | 702503165 |
9 | 266248261 |
10 | 118130293 |
11 | 60755046 |
12 | 3368a531 |
13 | 1b620ba8 |
14 | 11990581 |
15 | a58687d |
hex | 70a8675 |
118130293 has 2 divisors, whose sum is σ = 118130294. Its totient is φ = 118130292.
The previous prime is 118130273. The next prime is 118130321. The reversal of 118130293 is 392031811.
It is an a-pointer prime, because the next prime (118130321) can be obtained adding 118130293 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 67535524 + 50594769 = 8218^2 + 7113^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-118130293 is a prime.
It is a super-2 number, since 2×1181302932 = 27909532248531698, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (118130273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 59065146 + 59065147.
It is an arithmetic number, because the mean of its divisors is an integer number (59065147).
Almost surely, 2118130293 is an apocalyptic number.
It is an amenable number.
118130293 is a deficient number, since it is larger than the sum of its proper divisors (1).
118130293 is an equidigital number, since it uses as much as digits as its factorization.
118130293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 28.
The square root of 118130293 is about 10868.7760580481. The cubic root of 118130293 is about 490.6672749919.
The spelling of 118130293 in words is "one hundred eighteen million, one hundred thirty thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •