Base | Representation |
---|---|
bin | 1010110011110111001000… |
… | …1110100100111111110101 |
3 | 1120002022002010001220111222 |
4 | 2230331302032210333311 |
5 | 3024220203234312323 |
6 | 41140221135240125 |
7 | 2334512261632661 |
oct | 254756216447765 |
9 | 46068063056458 |
10 | 11886090932213 |
11 | 3872954509263 |
12 | 13bb72b979045 |
13 | 682b1338b624 |
14 | 2d140b5958a1 |
15 | 1592b7a659c8 |
hex | acf723a4ff5 |
11886090932213 has 2 divisors, whose sum is σ = 11886090932214. Its totient is φ = 11886090932212.
The previous prime is 11886090932201. The next prime is 11886090932251. The reversal of 11886090932213 is 31223909068811.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7392950124004 + 4493140808209 = 2718998^2 + 2119703^2 .
It is an emirp because it is prime and its reverse (31223909068811) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11886090932213 is a prime.
It is a super-2 number, since 2×118860909322132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11886090932713) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5943045466106 + 5943045466107.
It is an arithmetic number, because the mean of its divisors is an integer number (5943045466107).
Almost surely, 211886090932213 is an apocalyptic number.
It is an amenable number.
11886090932213 is a deficient number, since it is larger than the sum of its proper divisors (1).
11886090932213 is an equidigital number, since it uses as much as digits as its factorization.
11886090932213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1119744, while the sum is 53.
The spelling of 11886090932213 in words is "eleven trillion, eight hundred eighty-six billion, ninety million, nine hundred thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •