Base | Representation |
---|---|
bin | 10000001001110001010… |
… | …001100110100010111111 |
3 | 10221010002221121010020101 |
4 | 100021301101212202333 |
5 | 121141241003031421 |
6 | 2205532231101531 |
7 | 143123612225362 |
oct | 20116121464277 |
9 | 3833087533211 |
10 | 1110002002111 |
11 | 398827213242 |
12 | 15b1615118a7 |
13 | 80899016b12 |
14 | 3ba1d9cc0d9 |
15 | 1dd18b07191 |
hex | 102714668bf |
1110002002111 has 2 divisors, whose sum is σ = 1110002002112. Its totient is φ = 1110002002110.
The previous prime is 1110002002093. The next prime is 1110002002121. The reversal of 1110002002111 is 1112002000111.
It is an a-pointer prime, because the next prime (1110002002121) can be obtained adding 1110002002111 to its sum of digits (10).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1110002002111 - 29 = 1110002001599 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110002002121) 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, 555001001055 + 555001001056.
It is an arithmetic number, because the mean of its divisors is an integer number (555001001056).
Almost surely, 21110002002111 is an apocalyptic number.
1110002002111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110002002111 is an equidigital number, since it uses as much as digits as its factorization.
1110002002111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1110002002111 its reverse (1112002000111), we get a palindrome (2222004002222).
The spelling of 1110002002111 in words is "one trillion, one hundred ten billion, two million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •