Base | Representation |
---|---|
bin | 1010000110001011010001… |
… | …1001010010100001001001 |
3 | 1110022021012020202010111022 |
4 | 2201202310121102201021 |
5 | 2423340300314134233 |
6 | 35335455254442225 |
7 | 2224015426154663 |
oct | 241426431224111 |
9 | 43267166663438 |
10 | 11101222021193 |
11 | 35a0002471687 |
12 | 12b35a8963375 |
13 | 626ac1168355 |
14 | 2a5432a19533 |
15 | 143b7cd2e398 |
hex | a18b4652849 |
11101222021193 has 2 divisors, whose sum is σ = 11101222021194. Its totient is φ = 11101222021192.
The previous prime is 11101222021181. The next prime is 11101222021213. The reversal of 11101222021193 is 39112022210111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6549258959104 + 4551963062089 = 2559152^2 + 2133533^2 .
It is a cyclic number.
It is not a de Polignac number, because 11101222021193 - 26 = 11101222021129 is a prime.
It is a super-2 number, since 2×111012220211932 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11101222021103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550611010596 + 5550611010597.
It is an arithmetic number, because the mean of its divisors is an integer number (5550611010597).
Almost surely, 211101222021193 is an apocalyptic number.
It is an amenable number.
11101222021193 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101222021193 is an equidigital number, since it uses as much as digits as its factorization.
11101222021193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 26.
The spelling of 11101222021193 in words is "eleven trillion, one hundred one billion, two hundred twenty-two million, twenty-one thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •