Base | Representation |
---|---|
bin | 11010000010110011101001… |
… | …111110000100001100010001 |
3 | 120000120010012210212222111222 |
4 | 122002303221332010030101 |
5 | 110003124221440224103 |
6 | 1043335530445214425 |
7 | 33061252226012525 |
oct | 3202635176041421 |
9 | 500503183788458 |
10 | 114542113211153 |
11 | 3355104588a0a1 |
12 | 10a1b041b61415 |
13 | 4bbb3760323c4 |
14 | 203dc21599d85 |
15 | d397835ae638 |
hex | 682ce9f84311 |
114542113211153 has 2 divisors, whose sum is σ = 114542113211154. Its totient is φ = 114542113211152.
The previous prime is 114542113211143. The next prime is 114542113211233. The reversal of 114542113211153 is 351112311245411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 88316990834944 + 26225122376209 = 9397712^2 + 5121047^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114542113211153 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 (114542113211143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57271056605576 + 57271056605577.
It is an arithmetic number, because the mean of its divisors is an integer number (57271056605577).
Almost surely, 2114542113211153 is an apocalyptic number.
It is an amenable number.
114542113211153 is a deficient number, since it is larger than the sum of its proper divisors (1).
114542113211153 is an equidigital number, since it uses as much as digits as its factorization.
114542113211153 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14400, while the sum is 35.
Adding to 114542113211153 its reverse (351112311245411), we get a palindrome (465654424456564).
The spelling of 114542113211153 in words is "one hundred fourteen trillion, five hundred forty-two billion, one hundred thirteen million, two hundred eleven thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •