Base | Representation |
---|---|
bin | 1010000111010101011100… |
… | …0001000011011001111011 |
3 | 1110101011120200112120121101 |
4 | 2201311113001003121323 |
5 | 2424202033314120402 |
6 | 35352550544352231 |
7 | 2225321655120223 |
oct | 241652701033173 |
9 | 43334520476541 |
10 | 11121130223227 |
11 | 35a84990a1512 |
12 | 12b7424015677 |
13 | 62894481185b |
14 | 2a63a0a47083 |
15 | 1444459b5b87 |
hex | a1d5704367b |
11121130223227 has 2 divisors, whose sum is σ = 11121130223228. Its totient is φ = 11121130223226.
The previous prime is 11121130223197. The next prime is 11121130223239. The reversal of 11121130223227 is 72232203112111.
11121130223227 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 is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11121130223227 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11121130223195 and 11121130223204.
It is not a weakly prime, because it can be changed into another prime (11121130223257) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560565111613 + 5560565111614.
It is an arithmetic number, because the mean of its divisors is an integer number (5560565111614).
Almost surely, 211121130223227 is an apocalyptic number.
11121130223227 is a deficient number, since it is larger than the sum of its proper divisors (1).
11121130223227 is an equidigital number, since it uses as much as digits as its factorization.
11121130223227 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2016, while the sum is 28.
Adding to 11121130223227 its reverse (72232203112111), we get a palindrome (83353333335338).
The spelling of 11121130223227 in words is "eleven trillion, one hundred twenty-one billion, one hundred thirty million, two hundred twenty-three thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •