Base | Representation |
---|---|
bin | 1010000111011000101011… |
… | …1011010001001110011001 |
3 | 1110101020211101021211101221 |
4 | 2201312022323101032121 |
5 | 2424210324241402301 |
6 | 35353213215012041 |
7 | 2225352361463254 |
oct | 241661273211631 |
9 | 43336741254357 |
10 | 11122001122201 |
11 | 35a88a5757832 |
12 | 12b762780a021 |
13 | 628a530894a8 |
14 | 2a644458a09b |
15 | 144497194da1 |
hex | a1d8aed1399 |
11122001122201 has 2 divisors, whose sum is σ = 11122001122202. Its totient is φ = 11122001122200.
The previous prime is 11122001122153. The next prime is 11122001122231. The reversal of 11122001122201 is 10222110022111.
11122001122201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9597455296576 + 1524545825625 = 3097976^2 + 1234725^2 .
It is a cyclic number.
It is not a de Polignac number, because 11122001122201 - 225 = 11121967567769 is a prime.
It is not a weakly prime, because it can be changed into another prime (11122001122231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5561000561100 + 5561000561101.
It is an arithmetic number, because the mean of its divisors is an integer number (5561000561101).
Almost surely, 211122001122201 is an apocalyptic number.
It is an amenable number.
11122001122201 is a deficient number, since it is larger than the sum of its proper divisors (1).
11122001122201 is an equidigital number, since it uses as much as digits as its factorization.
11122001122201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11122001122201 its reverse (10222110022111), we get a palindrome (21344111144312).
The spelling of 11122001122201 in words is "eleven trillion, one hundred twenty-two billion, one million, one hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •