Base | Representation |
---|---|
bin | 1010000001100000110111… |
… | …1101000110010111010001 |
3 | 1110000121102211001010002021 |
4 | 2200120031331012113101 |
5 | 2421032223232432233 |
6 | 35235011022451441 |
7 | 2215151430013663 |
oct | 240301575062721 |
9 | 43017384033067 |
10 | 11021120202193 |
11 | 356a038041472 |
12 | 129bb72a33b81 |
13 | 61c396c03b0a |
14 | 2a15d4538533 |
15 | 141a4094be2d |
hex | a060df465d1 |
11021120202193 has 2 divisors, whose sum is σ = 11021120202194. Its totient is φ = 11021120202192.
The previous prime is 11021120202139. The next prime is 11021120202271. The reversal of 11021120202193 is 39120202112011.
Together with previous prime (11021120202139) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7674185333824 + 3346934868369 = 2770232^2 + 1829463^2 .
It is a cyclic number.
It is not a de Polignac number, because 11021120202193 - 225 = 11021086647761 is a prime.
It is a super-2 number, since 2×110211202021932 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11021120202493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510560101096 + 5510560101097.
It is an arithmetic number, because the mean of its divisors is an integer number (5510560101097).
Almost surely, 211021120202193 is an apocalyptic number.
It is an amenable number.
11021120202193 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021120202193 is an equidigital number, since it uses as much as digits as its factorization.
11021120202193 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 25.
The spelling of 11021120202193 in words is "eleven trillion, twenty-one billion, one hundred twenty million, two hundred two thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •