Base | Representation |
---|---|
bin | 11010000010110100100111… |
… | …011110111000010100000111 |
3 | 120000120012212201210122012221 |
4 | 122002310213132320110013 |
5 | 110003133330134122211 |
6 | 1043340221112553211 |
7 | 33061316626662631 |
oct | 3202644736702407 |
9 | 500505781718187 |
10 | 114543145223431 |
11 | 33551525388201 |
12 | 10a1b28b6b2807 |
13 | 4bbb4aba9a462 |
14 | 203dcbc67ba51 |
15 | d397e3eb5c71 |
hex | 682d277b8507 |
114543145223431 has 2 divisors, whose sum is σ = 114543145223432. Its totient is φ = 114543145223430.
The previous prime is 114543145223399. The next prime is 114543145223443. The reversal of 114543145223431 is 134322541345411.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 114543145223431 - 25 = 114543145223399 is a prime.
It is a super-2 number, since 2×1145431452234312 (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 (114543145223491) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57271572611715 + 57271572611716.
It is an arithmetic number, because the mean of its divisors is an integer number (57271572611716).
Almost surely, 2114543145223431 is an apocalyptic number.
114543145223431 is a deficient number, since it is larger than the sum of its proper divisors (1).
114543145223431 is an equidigital number, since it uses as much as digits as its factorization.
114543145223431 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 691200, while the sum is 43.
Adding to 114543145223431 its reverse (134322541345411), we get a palindrome (248865686568842).
The spelling of 114543145223431 in words is "one hundred fourteen trillion, five hundred forty-three billion, one hundred forty-five million, two hundred twenty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •