Base | Representation |
---|---|
bin | 1010000111010001001110… |
… | …1101110010110100101101 |
3 | 1110101001122222220020020101 |
4 | 2201310103231302310231 |
5 | 2424142230240213401 |
6 | 35352242531351101 |
7 | 2225251664543044 |
oct | 241642355626455 |
9 | 43331588806211 |
10 | 11120001101101 |
11 | 35a7a697a6332 |
12 | 12b7169a52491 |
13 | 6287c4905659 |
14 | 2a62d4ac755b |
15 | 1443cb7cb101 |
hex | a1d13b72d2d |
11120001101101 has 2 divisors, whose sum is σ = 11120001101102. Its totient is φ = 11120001101100.
The previous prime is 11120001101003. The next prime is 11120001101177. The reversal of 11120001101101 is 10110110002111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9820232375625 + 1299768725476 = 3133725^2 + 1140074^2 .
It is a cyclic number.
It is not a de Polignac number, because 11120001101101 - 213 = 11120001092909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11120001101201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560000550550 + 5560000550551.
It is an arithmetic number, because the mean of its divisors is an integer number (5560000550551).
Almost surely, 211120001101101 is an apocalyptic number.
It is an amenable number.
11120001101101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120001101101 is an equidigital number, since it uses as much as digits as its factorization.
11120001101101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 11120001101101 its reverse (10110110002111), we get a palindrome (21230111103212).
The spelling of 11120001101101 in words is "eleven trillion, one hundred twenty billion, one million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •