Base | Representation |
---|---|
bin | 1010001000100000101100… |
… | …0101010111100100000101 |
3 | 1110110002201112002120202121 |
4 | 2202020023011113210011 |
5 | 2430014421231404222 |
6 | 35410131252005541 |
7 | 2226635366665135 |
oct | 242101305274405 |
9 | 43402645076677 |
10 | 11141331122437 |
11 | 3606014a6803a |
12 | 12bb3213008b1 |
13 | 62a8139c9b59 |
14 | 2a73598a6ac5 |
15 | 144c291b75c7 |
hex | a220b157905 |
11141331122437 has 2 divisors, whose sum is σ = 11141331122438. Its totient is φ = 11141331122436.
The previous prime is 11141331122423. The next prime is 11141331122447. The reversal of 11141331122437 is 73422113314111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8063152105761 + 3078179016676 = 2839569^2 + 1754474^2 .
It is a cyclic number.
It is not a de Polignac number, because 11141331122437 - 211 = 11141331120389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11141331122417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5570665561218 + 5570665561219.
It is an arithmetic number, because the mean of its divisors is an integer number (5570665561219).
Almost surely, 211141331122437 is an apocalyptic number.
It is an amenable number.
11141331122437 is a deficient number, since it is larger than the sum of its proper divisors (1).
11141331122437 is an equidigital number, since it uses as much as digits as its factorization.
11141331122437 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 12096, while the sum is 34.
Adding to 11141331122437 its reverse (73422113314111), we get a palindrome (84563444436548).
The spelling of 11141331122437 in words is "eleven trillion, one hundred forty-one billion, three hundred thirty-one million, one hundred twenty-two thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •