Base | Representation |
---|---|
bin | 10000001001110111001… |
… | …000001101001010011001 |
3 | 10221010100210101012100101 |
4 | 100021313020031022121 |
5 | 121141441122432022 |
6 | 2205550055535401 |
7 | 143126214013003 |
oct | 20116710151231 |
9 | 3833323335311 |
10 | 1110100202137 |
11 | 398877695393 |
12 | 15b18a38a561 |
13 | 808b347a244 |
14 | 3ba2ca71373 |
15 | 1dd22553627 |
hex | 1027720d299 |
1110100202137 has 2 divisors, whose sum is σ = 1110100202138. Its totient is φ = 1110100202136.
The previous prime is 1110100202129. The next prime is 1110100202143. The reversal of 1110100202137 is 7312020010111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 780146461081 + 329953741056 = 883259^2 + 574416^2 .
It is an emirp because it is prime and its reverse (7312020010111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1110100202137 - 23 = 1110100202129 is a prime.
It is not a weakly prime, because it can be changed into another prime (1110100202177) 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, 555050101068 + 555050101069.
It is an arithmetic number, because the mean of its divisors is an integer number (555050101069).
Almost surely, 21110100202137 is an apocalyptic number.
It is an amenable number.
1110100202137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110100202137 is an equidigital number, since it uses as much as digits as its factorization.
1110100202137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 19.
Adding to 1110100202137 its reverse (7312020010111), we get a palindrome (8422120212248).
The spelling of 1110100202137 in words is "one trillion, one hundred ten billion, one hundred million, two hundred two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •