Base | Representation |
---|---|
bin | 11001111011011000000011… |
… | …001101011001100101110111 |
3 | 112221202022001210210001010021 |
4 | 121323120003031121211313 |
5 | 104421242340000200033 |
6 | 1042305152430510011 |
7 | 33006333163361653 |
oct | 3173300315314567 |
9 | 487668053701107 |
10 | 114031435553143 |
11 | 33374507638149 |
12 | 10958081065307 |
13 | 4b8216c9ab1c4 |
14 | 2023218213a63 |
15 | d2b345360b2d |
hex | 67b603359977 |
114031435553143 has 16 divisors (see below), whose sum is σ = 120543675487840. Its totient is φ = 107570347315200.
The previous prime is 114031435553137. The next prime is 114031435553201. The reversal of 114031435553143 is 341355534130411.
It is a cyclic number.
It is not a de Polignac number, because 114031435553143 - 29 = 114031435552631 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 114031435553143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114031435653143) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42948871 + ... + 45526567.
It is an arithmetic number, because the mean of its divisors is an integer number (7533979717990).
Almost surely, 2114031435553143 is an apocalyptic number.
114031435553143 is a deficient number, since it is larger than the sum of its proper divisors (6512239934697).
114031435553143 is a wasteful number, since it uses less digits than its factorization.
114031435553143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2587618.
The product of its (nonzero) digits is 648000, while the sum is 43.
Adding to 114031435553143 its reverse (341355534130411), we get a palindrome (455386969683554).
The spelling of 114031435553143 in words is "one hundred fourteen trillion, thirty-one billion, four hundred thirty-five million, five hundred fifty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •