Base | Representation |
---|---|
bin | 1010000110010010011011… |
… | …0111000111010101000111 |
3 | 1110022110011002100122000101 |
4 | 2201210212313013111013 |
5 | 2423403213431123221 |
6 | 35340414020024531 |
7 | 2224114135366243 |
oct | 241444667072507 |
9 | 43273132318011 |
10 | 11103142442311 |
11 | 35a08a84a5477 |
12 | 12b3a43b32147 |
13 | 627038c9bbca |
14 | 2a5575abb423 |
15 | 143c41722d91 |
hex | a1926dc7547 |
11103142442311 has 2 divisors, whose sum is σ = 11103142442312. Its totient is φ = 11103142442310.
The previous prime is 11103142442299. The next prime is 11103142442351. The reversal of 11103142442311 is 11324424130111.
11103142442311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11103142442311 - 211 = 11103142440263 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11103142442311.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11103142442351) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5551571221155 + 5551571221156.
It is an arithmetic number, because the mean of its divisors is an integer number (5551571221156).
Almost surely, 211103142442311 is an apocalyptic number.
11103142442311 is a deficient number, since it is larger than the sum of its proper divisors (1).
11103142442311 is an equidigital number, since it uses as much as digits as its factorization.
11103142442311 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2304, while the sum is 28.
Adding to 11103142442311 its reverse (11324424130111), we get a palindrome (22427566572422).
The spelling of 11103142442311 in words is "eleven trillion, one hundred three billion, one hundred forty-two million, four hundred forty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •