Base | Representation |
---|---|
bin | 11001010000110111010110… |
… | …000010101100100001010101 |
3 | 112120102000120220120021101202 |
4 | 121100313112002230201111 |
5 | 104030411441100323333 |
6 | 1032151135243402245 |
7 | 32255303600105561 |
oct | 3120672602544125 |
9 | 476360526507352 |
10 | 111110100011093 |
11 | 3244858a904a97 |
12 | 10565a6b823385 |
13 | 49cc8396b2751 |
14 | 1d61a869626a1 |
15 | cca366c295e8 |
hex | 650dd60ac855 |
111110100011093 has 2 divisors, whose sum is σ = 111110100011094. Its totient is φ = 111110100011092.
The previous prime is 111110100011069. The next prime is 111110100011123. The reversal of 111110100011093 is 390110001011111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 64467442422244 + 46642657588849 = 8029162^2 + 6829543^2 .
It is a cyclic number.
It is not a de Polignac number, because 111110100011093 - 226 = 111110032902229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111110100011003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55555050005546 + 55555050005547.
It is an arithmetic number, because the mean of its divisors is an integer number (55555050005547).
Almost surely, 2111110100011093 is an apocalyptic number.
It is an amenable number.
111110100011093 is a deficient number, since it is larger than the sum of its proper divisors (1).
111110100011093 is an equidigital number, since it uses as much as digits as its factorization.
111110100011093 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 111110100011093 in words is "one hundred eleven trillion, one hundred ten billion, one hundred million, eleven thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •