Base | Representation |
---|---|
bin | 11010000010110100101100… |
… | …100110110110110000000111 |
3 | 120000120020002201120201021001 |
4 | 122002310230212312300013 |
5 | 110003134014141402023 |
6 | 1043340233423434131 |
7 | 33061322022531145 |
oct | 3202645446666007 |
9 | 500506081521231 |
10 | 114543231200263 |
11 | 33551569970938 |
12 | 10a1b2b4455947 |
13 | 4bbb4c3841118 |
14 | 203dcc9c5c595 |
15 | d397eb7ea6ad |
hex | 682d2c9b6c07 |
114543231200263 has 2 divisors, whose sum is σ = 114543231200264. Its totient is φ = 114543231200262.
The previous prime is 114543231200221. The next prime is 114543231200339. The reversal of 114543231200263 is 362002132345411.
It is a weak prime.
It is an emirp because it is prime and its reverse (362002132345411) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114543231200263 is a prime.
It is a super-2 number, since 2×1145432312002632 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114543231900263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57271615600131 + 57271615600132.
It is an arithmetic number, because the mean of its divisors is an integer number (57271615600132).
Almost surely, 2114543231200263 is an apocalyptic number.
114543231200263 is a deficient number, since it is larger than the sum of its proper divisors (1).
114543231200263 is an equidigital number, since it uses as much as digits as its factorization.
114543231200263 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 103680, while the sum is 37.
Adding to 114543231200263 its reverse (362002132345411), we get a palindrome (476545363545674).
The spelling of 114543231200263 in words is "one hundred fourteen trillion, five hundred forty-three billion, two hundred thirty-one million, two hundred thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •