Base | Representation |
---|---|
bin | 1010000111111010100111… |
… | …1000000100010100000101 |
3 | 1110102010100012211120112021 |
4 | 2201332221320010110011 |
5 | 2424333003214424143 |
6 | 35401321140323141 |
7 | 2226124201350436 |
oct | 241765170042405 |
9 | 43363305746467 |
10 | 11131110311173 |
11 | 360174a646286 |
12 | 12b934a3a34b1 |
13 | 629875349938 |
14 | 2a6a6a2a548d |
15 | 14482bc3dced |
hex | a1fa9e04505 |
11131110311173 has 2 divisors, whose sum is σ = 11131110311174. Its totient is φ = 11131110311172.
The previous prime is 11131110311149. The next prime is 11131110311201. The reversal of 11131110311173 is 37111301113111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9077457945924 + 2053652365249 = 3012882^2 + 1433057^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11131110311173 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11131110311773) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5565555155586 + 5565555155587.
It is an arithmetic number, because the mean of its divisors is an integer number (5565555155587).
Almost surely, 211131110311173 is an apocalyptic number.
It is an amenable number.
11131110311173 is a deficient number, since it is larger than the sum of its proper divisors (1).
11131110311173 is an equidigital number, since it uses as much as digits as its factorization.
11131110311173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 189, while the sum is 25.
Adding to 11131110311173 its reverse (37111301113111), we get a palindrome (48242411424284).
The spelling of 11131110311173 in words is "eleven trillion, one hundred thirty-one billion, one hundred ten million, three hundred eleven thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.154 sec. • engine limits •