Base | Representation |
---|---|
bin | 1010000110101100110011… |
… | …0101111100110001110101 |
3 | 1110100010102111000121220222 |
4 | 2201223030311330301311 |
5 | 2424012213330401401 |
6 | 35343544322104125 |
7 | 2224454442566144 |
oct | 241531465746165 |
9 | 43303374017828 |
10 | 11110222122101 |
11 | 35a3900821703 |
12 | 12b529aaab045 |
13 | 6278c695254b |
14 | 2a5a4805975b |
15 | 14400802ac1b |
hex | a1accd7cc75 |
11110222122101 has 2 divisors, whose sum is σ = 11110222122102. Its totient is φ = 11110222122100.
The previous prime is 11110222122071. The next prime is 11110222122137. The reversal of 11110222122101 is 10122122201111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11053696584100 + 56525538001 = 3324710^2 + 237751^2 .
It is a cyclic number.
It is not a de Polignac number, because 11110222122101 - 26 = 11110222122037 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11110222122101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11110222122151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555111061050 + 5555111061051.
It is an arithmetic number, because the mean of its divisors is an integer number (5555111061051).
Almost surely, 211110222122101 is an apocalyptic number.
It is an amenable number.
11110222122101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11110222122101 is an equidigital number, since it uses as much as digits as its factorization.
11110222122101 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 17.
Adding to 11110222122101 its reverse (10122122201111), we get a palindrome (21232344323212).
The spelling of 11110222122101 in words is "eleven trillion, one hundred ten billion, two hundred twenty-two million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.309 sec. • engine limits •