Base | Representation |
---|---|
bin | 10000000001011001111… |
… | …010000100000101100101 |
3 | 10220020220222102012121202 |
4 | 100001121322010011211 |
5 | 121014342111133333 |
6 | 2201445052052245 |
7 | 142355205522656 |
oct | 20013172040545 |
9 | 3806828365552 |
10 | 1101020021093 |
11 | 394a38109a33 |
12 | 159475464085 |
13 | 7ca97205355 |
14 | 3b40ab4752d |
15 | 1d9902d95e8 |
hex | 10059e84165 |
1101020021093 has 2 divisors, whose sum is σ = 1101020021094. Its totient is φ = 1101020021092.
The previous prime is 1101020021071. The next prime is 1101020021191. The reversal of 1101020021093 is 3901200201011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 941146396129 + 159873624964 = 970127^2 + 399842^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101020021093 - 26 = 1101020021029 is a prime.
It is a super-3 number, since 3×11010200210933 (a number of 37 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101020021393) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550510010546 + 550510010547.
It is an arithmetic number, because the mean of its divisors is an integer number (550510010547).
Almost surely, 21101020021093 is an apocalyptic number.
It is an amenable number.
1101020021093 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101020021093 is an equidigital number, since it uses as much as digits as its factorization.
1101020021093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 20.
The spelling of 1101020021093 in words is "one trillion, one hundred one billion, twenty million, twenty-one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •