Base | Representation |
---|---|
bin | 11001111110011010010011… |
… | …111011100101110100011011 |
3 | 112222111020110112222222200101 |
4 | 121332122103323211310123 |
5 | 104433202031113324123 |
6 | 1042545050330320231 |
7 | 33030366146124166 |
oct | 3176322373456433 |
9 | 488436415888611 |
10 | 114240022011163 |
11 | 33444a15215344 |
12 | 10990594289077 |
13 | 4b98a31ba7269 |
14 | 202d36481cadd |
15 | d319a2525aad |
hex | 67e693ee5d1b |
114240022011163 has 2 divisors, whose sum is σ = 114240022011164. Its totient is φ = 114240022011162.
The previous prime is 114240022011097. The next prime is 114240022011187. The reversal of 114240022011163 is 361110220042411.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 114240022011163 - 213 = 114240022002971 is a prime.
It is a super-2 number, since 2×1142400220111632 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (114240022071163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57120011005581 + 57120011005582.
It is an arithmetic number, because the mean of its divisors is an integer number (57120011005582).
Almost surely, 2114240022011163 is an apocalyptic number.
114240022011163 is a deficient number, since it is larger than the sum of its proper divisors (1).
114240022011163 is an equidigital number, since it uses as much as digits as its factorization.
114240022011163 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 28.
Adding to 114240022011163 its reverse (361110220042411), we get a palindrome (475350242053574).
The spelling of 114240022011163 in words is "one hundred fourteen trillion, two hundred forty billion, twenty-two million, eleven thousand, one hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •