Base | Representation |
---|---|
bin | 1010000111010110000111… |
… | …0011001000001011001111 |
3 | 1110101012001021221012020122 |
4 | 2201311201303020023033 |
5 | 2424202421121402002 |
6 | 35353020525535155 |
7 | 2225326312541243 |
oct | 241654163101317 |
9 | 43335037835218 |
10 | 11121311122127 |
11 | 35a8581218538 |
12 | 12b74747144bb |
13 | 62897313b91b |
14 | 2a63baa96423 |
15 | 1444567ea6a2 |
hex | a1d61cc82cf |
11121311122127 has 2 divisors, whose sum is σ = 11121311122128. Its totient is φ = 11121311122126.
The previous prime is 11121311122123. The next prime is 11121311122133. The reversal of 11121311122127 is 72122111312111.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11121311122127 - 22 = 11121311122123 is a prime.
It is a super-2 number, since 2×111213111221272 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11121311122096 and 11121311122105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11121311122121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560655561063 + 5560655561064.
It is an arithmetic number, because the mean of its divisors is an integer number (5560655561064).
Almost surely, 211121311122127 is an apocalyptic number.
11121311122127 is a deficient number, since it is larger than the sum of its proper divisors (1).
11121311122127 is an equidigital number, since it uses as much as digits as its factorization.
11121311122127 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 336, while the sum is 26.
Adding to 11121311122127 its reverse (72122111312111), we get a palindrome (83243422434238).
The spelling of 11121311122127 in words is "eleven trillion, one hundred twenty-one billion, three hundred eleven million, one hundred twenty-two thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •