Base | Representation |
---|---|
bin | 1010111001111011001101… |
… | …1001110100011001010011 |
3 | 1120110020222002100101201221 |
4 | 2232132303121310121103 |
5 | 3032422024441104021 |
6 | 41300130121305511 |
7 | 2345160624050425 |
oct | 256366331643123 |
9 | 46406862311657 |
10 | 11990263613011 |
11 | 3903051251192 |
12 | 1417963035297 |
13 | 68c8a5500058 |
14 | 2d649087a815 |
15 | 15bd63285241 |
hex | ae7b3674653 |
11990263613011 has 2 divisors, whose sum is σ = 11990263613012. Its totient is φ = 11990263613010.
The previous prime is 11990263612933. The next prime is 11990263613099. The reversal of 11990263613011 is 11031636209911.
It is a weak prime.
It is an emirp because it is prime and its reverse (11031636209911) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11990263613011 - 27 = 11990263612883 is a prime.
It is a super-2 number, since 2×119902636130112 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11990263613311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5995131806505 + 5995131806506.
It is an arithmetic number, because the mean of its divisors is an integer number (5995131806506).
Almost surely, 211990263613011 is an apocalyptic number.
11990263613011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11990263613011 is an equidigital number, since it uses as much as digits as its factorization.
11990263613011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 52488, while the sum is 43.
The spelling of 11990263613011 in words is "eleven trillion, nine hundred ninety billion, two hundred sixty-three million, six hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •