Base | Representation |
---|---|
bin | 1010000111010010000011… |
… | …1001010001000001101001 |
3 | 1110101002020101221211122101 |
4 | 2201310200321101001221 |
5 | 2424143203341242301 |
6 | 35352320510453401 |
7 | 2225260321134604 |
oct | 241644071210151 |
9 | 43332211854571 |
10 | 11120222212201 |
11 | 35a8072598383 |
12 | 12b720bb04261 |
13 | 62882b671a1b |
14 | 2a631620333b |
15 | 1443e0e05701 |
hex | a1d20e51069 |
11120222212201 has 2 divisors, whose sum is σ = 11120222212202. Its totient is φ = 11120222212200.
The previous prime is 11120222212193. The next prime is 11120222212261. The reversal of 11120222212201 is 10221222202111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7770044750400 + 3350177461801 = 2787480^2 + 1830349^2 .
It is a cyclic number.
It is not a de Polignac number, because 11120222212201 - 23 = 11120222212193 is a prime.
It is not a weakly prime, because it can be changed into another prime (11120222212261) 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, 5560111106100 + 5560111106101.
It is an arithmetic number, because the mean of its divisors is an integer number (5560111106101).
Almost surely, 211120222212201 is an apocalyptic number.
It is an amenable number.
11120222212201 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120222212201 is an equidigital number, since it uses as much as digits as its factorization.
11120222212201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 11120222212201 its reverse (10221222202111), we get a palindrome (21341444414312).
The spelling of 11120222212201 in words is "eleven trillion, one hundred twenty billion, two hundred twenty-two million, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •