Base | Representation |
---|---|
bin | 1010001110011000100010… |
… | …0010101010010010011101 |
3 | 1110210202010122200210200022 |
4 | 2203212020202222102131 |
5 | 2433143031332413432 |
6 | 35524334335041525 |
7 | 2240136461004563 |
oct | 243461042522235 |
9 | 43722118623608 |
10 | 11242220201117 |
11 | 3644887246104 |
12 | 13169989702a5 |
13 | 6371a177ac49 |
14 | 2ac1aaa3da33 |
15 | 1476814c2b12 |
hex | a39888aa49d |
11242220201117 has 2 divisors, whose sum is σ = 11242220201118. Its totient is φ = 11242220201116.
The previous prime is 11242220201089. The next prime is 11242220201161. The reversal of 11242220201117 is 71110202224211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9866546903236 + 1375673297881 = 3141106^2 + 1172891^2 .
It is a cyclic number.
It is not a de Polignac number, because 11242220201117 - 216 = 11242220135581 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11242220200117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5621110100558 + 5621110100559.
It is an arithmetic number, because the mean of its divisors is an integer number (5621110100559).
Almost surely, 211242220201117 is an apocalyptic number.
It is an amenable number.
11242220201117 is a deficient number, since it is larger than the sum of its proper divisors (1).
11242220201117 is an equidigital number, since it uses as much as digits as its factorization.
11242220201117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 896, while the sum is 26.
Adding to 11242220201117 its reverse (71110202224211), we get a palindrome (82352422425328).
The spelling of 11242220201117 in words is "eleven trillion, two hundred forty-two billion, two hundred twenty million, two hundred one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •