Base | Representation |
---|---|
bin | 10000000001011110101… |
… | …111011001011011010101 |
3 | 10220021010122000000001112 |
4 | 100001132233121123111 |
5 | 121020023341022442 |
6 | 2201501110104405 |
7 | 142360212005456 |
oct | 20013657313325 |
9 | 3807118000045 |
10 | 1101101110997 |
11 | 394a79964a88 |
12 | 15949864b105 |
13 | 7caaac57844 |
14 | 3b41781512d |
15 | 1d9974a6082 |
hex | 1005ebd96d5 |
1101101110997 has 2 divisors, whose sum is σ = 1101101110998. Its totient is φ = 1101101110996.
The previous prime is 1101101110973. The next prime is 1101101111009. The reversal of 1101101110997 is 7990111011011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1019758648561 + 81342462436 = 1009831^2 + 285206^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101101110997 - 26 = 1101101110933 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101101110097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550550555498 + 550550555499.
It is an arithmetic number, because the mean of its divisors is an integer number (550550555499).
Almost surely, 21101101110997 is an apocalyptic number.
It is an amenable number.
1101101110997 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101101110997 is an equidigital number, since it uses as much as digits as its factorization.
1101101110997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 567, while the sum is 32.
The spelling of 1101101110997 in words is "one trillion, one hundred one billion, one hundred one million, one hundred ten thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •