Base | Representation |
---|---|
bin | 1010000001011100110001… |
… | …1100011011110001011101 |
3 | 1110000111121012220221212211 |
4 | 2200113030130123301131 |
5 | 2421023000401320333 |
6 | 35234310001400421 |
7 | 2215112252662666 |
oct | 240271434336135 |
9 | 43014535827784 |
10 | 11020021120093 |
11 | 35696236a3857 |
12 | 129b906939111 |
13 | 61c2502b4b8b |
14 | 2a152c59836d |
15 | 1419c91e7ecd |
hex | a05cc71bc5d |
11020021120093 has 2 divisors, whose sum is σ = 11020021120094. Its totient is φ = 11020021120092.
The previous prime is 11020021120049. The next prime is 11020021120223. The reversal of 11020021120093 is 39002112002011.
11020021120093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10597544519769 + 422476600324 = 3255387^2 + 649982^2 .
It is a cyclic number.
It is not a de Polignac number, because 11020021120093 - 213 = 11020021111901 is a prime.
It is a super-3 number, since 3×110200211200933 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11020021120393) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510010560046 + 5510010560047.
It is an arithmetic number, because the mean of its divisors is an integer number (5510010560047).
Almost surely, 211020021120093 is an apocalyptic number.
It is an amenable number.
11020021120093 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020021120093 is an equidigital number, since it uses as much as digits as its factorization.
11020021120093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 22.
The spelling of 11020021120093 in words is "eleven trillion, twenty billion, twenty-one million, one hundred twenty thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •