Base | Representation |
---|---|
bin | 11001000010110010001010… |
… | …010101001010001011010111 |
3 | 112102222111221120012101112222 |
4 | 121002302022111022023113 |
5 | 103414033230302004033 |
6 | 1030130425405532555 |
7 | 32125346613655115 |
oct | 3102621225121327 |
9 | 472874846171488 |
10 | 110142462141143 |
11 | 3210517951a423 |
12 | 1042a41b87415b |
13 | 495c50ac987b3 |
14 | 1d2acd0566ab5 |
15 | cb00d1682598 |
hex | 642c8a54a2d7 |
110142462141143 has 2 divisors, whose sum is σ = 110142462141144. Its totient is φ = 110142462141142.
The previous prime is 110142462141133. The next prime is 110142462141149. The reversal of 110142462141143 is 341141264241011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110142462141143 - 26 = 110142462141079 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110142462141149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55071231070571 + 55071231070572.
It is an arithmetic number, because the mean of its divisors is an integer number (55071231070572).
Almost surely, 2110142462141143 is an apocalyptic number.
110142462141143 is a deficient number, since it is larger than the sum of its proper divisors (1).
110142462141143 is an equidigital number, since it uses as much as digits as its factorization.
110142462141143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18432, while the sum is 35.
The spelling of 110142462141143 in words is "one hundred ten trillion, one hundred forty-two billion, four hundred sixty-two million, one hundred forty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •