Base | Representation |
---|---|
bin | 11010000010110011101010… |
… | …000110000101011000101001 |
3 | 120000120010012221211202222022 |
4 | 122002303222012011120221 |
5 | 110003124223010010233 |
6 | 1043335531002234225 |
7 | 33061252252616111 |
oct | 3202635206053051 |
9 | 500503187752868 |
10 | 114542115313193 |
11 | 33551046a95417 |
12 | 10a1b0427b5975 |
13 | 4bbb3765ba109 |
14 | 203dc21986041 |
15 | d39783877398 |
hex | 682cea185629 |
114542115313193 has 2 divisors, whose sum is σ = 114542115313194. Its totient is φ = 114542115313192.
The previous prime is 114542115313141. The next prime is 114542115313217. The reversal of 114542115313193 is 391313511245411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 85564220508649 + 28977894804544 = 9250093^2 + 5383112^2 .
It is an emirp because it is prime and its reverse (391313511245411) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114542115313193 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (114542115313133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57271057656596 + 57271057656597.
It is an arithmetic number, because the mean of its divisors is an integer number (57271057656597).
Almost surely, 2114542115313193 is an apocalyptic number.
It is an amenable number.
114542115313193 is a deficient number, since it is larger than the sum of its proper divisors (1).
114542115313193 is an equidigital number, since it uses as much as digits as its factorization.
114542115313193 is an evil number, because the sum of its binary digits is even.
The product of its digits is 194400, while the sum is 44.
The spelling of 114542115313193 in words is "one hundred fourteen trillion, five hundred forty-two billion, one hundred fifteen million, three hundred thirteen thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •