Base | Representation |
---|---|
bin | 110011010010011011… |
… | …1100010000000011101 |
3 | 101112021212020000210011 |
4 | 1212210313202000131 |
5 | 3301031342444122 |
6 | 122333034443221 |
7 | 10646243164444 |
oct | 1464467420035 |
9 | 345255200704 |
10 | 110140203037 |
11 | 4278a300797 |
12 | 19419893511 |
13 | a503578797 |
14 | 548ba7bd5b |
15 | 2ce958e377 |
hex | 19a4de201d |
110140203037 has 2 divisors, whose sum is σ = 110140203038. Its totient is φ = 110140203036.
The previous prime is 110140203023. The next prime is 110140203049. The reversal of 110140203037 is 730302041011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 108734403001 + 1405800036 = 329749^2 + 37494^2 .
It is a cyclic number.
It is not a de Polignac number, because 110140203037 - 219 = 110139678749 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110140202999 and 110140203017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110140203137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55070101518 + 55070101519.
It is an arithmetic number, because the mean of its divisors is an integer number (55070101519).
Almost surely, 2110140203037 is an apocalyptic number.
It is an amenable number.
110140203037 is a deficient number, since it is larger than the sum of its proper divisors (1).
110140203037 is an equidigital number, since it uses as much as digits as its factorization.
110140203037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 22.
Adding to 110140203037 its reverse (730302041011), we get a palindrome (840442244048).
The spelling of 110140203037 in words is "one hundred ten billion, one hundred forty million, two hundred three thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •