Base | Representation |
---|---|
bin | 110011010100001111… |
… | …1111011000101000111 |
3 | 101112110002212002110101 |
4 | 1212220133323011013 |
5 | 3301142441420033 |
6 | 122343052304531 |
7 | 10650613043206 |
oct | 1465037730507 |
9 | 345402762411 |
10 | 110201123143 |
11 | 4281072a991 |
12 | 19436172147 |
13 | a513088497 |
14 | 5495bb923d |
15 | 2ceeac497d |
hex | 19a87fb147 |
110201123143 has 2 divisors, whose sum is σ = 110201123144. Its totient is φ = 110201123142.
The previous prime is 110201123101. The next prime is 110201123177. The reversal of 110201123143 is 341321102011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110201123143 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110201123143.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110201120143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55100561571 + 55100561572.
It is an arithmetic number, because the mean of its divisors is an integer number (55100561572).
Almost surely, 2110201123143 is an apocalyptic number.
110201123143 is a deficient number, since it is larger than the sum of its proper divisors (1).
110201123143 is an equidigital number, since it uses as much as digits as its factorization.
110201123143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 110201123143 its reverse (341321102011), we get a palindrome (451522225154).
The spelling of 110201123143 in words is "one hundred ten billion, two hundred one million, one hundred twenty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •