Base | Representation |
---|---|
bin | 1010000000111011001101… |
… | …0110100101011110101001 |
3 | 1102222122100020022220111011 |
4 | 2200032303112211132221 |
5 | 2420401022104100433 |
6 | 35230215510503521 |
7 | 2214343045422025 |
oct | 240166326453651 |
9 | 42878306286434 |
10 | 11011010221993 |
11 | 356581a239731 |
12 | 129a011064ba1 |
13 | 61b4454ba302 |
14 | 2a0d15947385 |
15 | 14164d0b73cd |
hex | a03b35a57a9 |
11011010221993 has 2 divisors, whose sum is σ = 11011010221994. Its totient is φ = 11011010221992.
The previous prime is 11011010221979. The next prime is 11011010222071. The reversal of 11011010221993 is 39912201011011.
11011010221993 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., 10083724038144 + 927286183849 = 3175488^2 + 962957^2 .
It is a cyclic number.
It is not a de Polignac number, because 11011010221993 - 221 = 11011008124841 is a prime.
It is a super-2 number, since 2×110110102219932 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11011010221963) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505505110996 + 5505505110997.
It is an arithmetic number, because the mean of its divisors is an integer number (5505505110997).
Almost surely, 211011010221993 is an apocalyptic number.
It is an amenable number.
11011010221993 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011010221993 is an equidigital number, since it uses as much as digits as its factorization.
11011010221993 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 31.
The spelling of 11011010221993 in words is "eleven trillion, eleven billion, ten million, two hundred twenty-one thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •