Base | Representation |
---|---|
bin | 1010000000010110010101… |
… | …0100001000011010001001 |
3 | 1102221200210100020101212111 |
4 | 2200011211110020122021 |
5 | 2420220233410134233 |
6 | 35221501324342321 |
7 | 2213542533541216 |
oct | 240054524103211 |
9 | 42850710211774 |
10 | 11001111021193 |
11 | 35615aa411647 |
12 | 12981099a49a1 |
13 | 61a528663347 |
14 | 2a0656d42b0d |
15 | 14126debaacd |
hex | a0165508689 |
11001111021193 has 2 divisors, whose sum is σ = 11001111021194. Its totient is φ = 11001111021192.
The previous prime is 11001111021167. The next prime is 11001111021217. The reversal of 11001111021193 is 39112011110011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7163480955024 + 3837630066169 = 2676468^2 + 1958987^2 .
It is a cyclic number.
It is not a de Polignac number, because 11001111021193 - 221 = 11001108924041 is a prime.
It is a super-2 number, since 2×110011110211932 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11001111021143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500555510596 + 5500555510597.
It is an arithmetic number, because the mean of its divisors is an integer number (5500555510597).
Almost surely, 211001111021193 is an apocalyptic number.
It is an amenable number.
11001111021193 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001111021193 is an equidigital number, since it uses as much as digits as its factorization.
11001111021193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 22.
The spelling of 11001111021193 in words is "eleven trillion, one billion, one hundred eleven million, twenty-one thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •