Base | Representation |
---|---|
bin | 10000001001110111001… |
… | …000001100111011000111 |
3 | 10221010100210101011000011 |
4 | 100021313020030323013 |
5 | 121141441122414114 |
6 | 2205550055531051 |
7 | 143126214010105 |
oct | 20116710147307 |
9 | 3833323334004 |
10 | 1110100201159 |
11 | 398877694684 |
12 | 15b18a389a87 |
13 | 808b3479971 |
14 | 3ba2ca70c75 |
15 | 1dd225531c4 |
hex | 1027720cec7 |
1110100201159 has 2 divisors, whose sum is σ = 1110100201160. Its totient is φ = 1110100201158.
The previous prime is 1110100201109. The next prime is 1110100201169. The reversal of 1110100201159 is 9511020010111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1110100201159 - 215 = 1110100168391 is a prime.
It is a super-2 number, since 2×11101002011592 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110100201109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555050100579 + 555050100580.
It is an arithmetic number, because the mean of its divisors is an integer number (555050100580).
Almost surely, 21110100201159 is an apocalyptic number.
1110100201159 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110100201159 is an equidigital number, since it uses as much as digits as its factorization.
1110100201159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 22.
The spelling of 1110100201159 in words is "one trillion, one hundred ten billion, one hundred million, two hundred one thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •