Base | Representation |
---|---|
bin | 110011001110010010… |
… | …0111011110001111111 |
3 | 101111221011111101012111 |
4 | 1212130210323301333 |
5 | 3300240241011033 |
6 | 122311145314451 |
7 | 10642634003011 |
oct | 1463444736177 |
9 | 344834441174 |
10 | 110001110143 |
11 | 42718839191 |
12 | 1939b195a27 |
13 | a4b07c82b2 |
14 | 54773d21b1 |
15 | 2cdc2667cd |
hex | 199c93bc7f |
110001110143 has 2 divisors, whose sum is σ = 110001110144. Its totient is φ = 110001110142.
The previous prime is 110001110137. The next prime is 110001110159. The reversal of 110001110143 is 341011100011.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110001110143 is a prime.
It is a super-4 number, since 4×1100011101434 (a number of 45 digits) contains 4444 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110001110543) 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, 55000555071 + 55000555072.
It is an arithmetic number, because the mean of its divisors is an integer number (55000555072).
Almost surely, 2110001110143 is an apocalyptic number.
110001110143 is a deficient number, since it is larger than the sum of its proper divisors (1).
110001110143 is an equidigital number, since it uses as much as digits as its factorization.
110001110143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 110001110143 its reverse (341011100011), we get a palindrome (451012210154).
The spelling of 110001110143 in words is "one hundred ten billion, one million, one hundred ten thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •