Base | Representation |
---|---|
bin | 10000001001110001110… |
… | …100010110011010110101 |
3 | 10221010010120201220102002 |
4 | 100021301310112122311 |
5 | 121141300321023333 |
6 | 2205533154225045 |
7 | 143124052524233 |
oct | 20116164263265 |
9 | 3833116656362 |
10 | 1110011111093 |
11 | 398831374a25 |
12 | 15b164585185 |
13 | 8089ab85c51 |
14 | 3ba20cbd953 |
15 | 1dd198060e8 |
hex | 10271d166b5 |
1110011111093 has 2 divisors, whose sum is σ = 1110011111094. Its totient is φ = 1110011111092.
The previous prime is 1110011111089. The next prime is 1110011111129. The reversal of 1110011111093 is 3901111100111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 720763644484 + 389247466609 = 848978^2 + 623897^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110011111093 - 22 = 1110011111089 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110011311093) 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, 555005555546 + 555005555547.
It is an arithmetic number, because the mean of its divisors is an integer number (555005555547).
Almost surely, 21110011111093 is an apocalyptic number.
It is an amenable number.
1110011111093 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110011111093 is an equidigital number, since it uses as much as digits as its factorization.
1110011111093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 20.
The spelling of 1110011111093 in words is "one trillion, one hundred ten billion, eleven million, one hundred eleven thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •