Base | Representation |
---|---|
bin | 1010000000111111101011… |
… | …1011010001010101001011 |
3 | 1102222202102220211211020022 |
4 | 2200033322323101111023 |
5 | 2420411002010134011 |
6 | 35230535004051055 |
7 | 2214414566146115 |
oct | 240177273212513 |
9 | 42882386754208 |
10 | 11012211021131 |
11 | 3566286040911 |
12 | 129a2a7233a8b |
13 | 61b5a7201448 |
14 | 2a0dcb2043b5 |
15 | 1416bd70e8db |
hex | a03faed154b |
11012211021131 has 2 divisors, whose sum is σ = 11012211021132. Its totient is φ = 11012211021130.
The previous prime is 11012211021047. The next prime is 11012211021139. The reversal of 11012211021131 is 13112011221011.
It is a strong prime.
It is an emirp because it is prime and its reverse (13112011221011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11012211021131 is a prime.
It is a super-2 number, since 2×110122110211312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11012211021139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506105510565 + 5506105510566.
It is an arithmetic number, because the mean of its divisors is an integer number (5506105510566).
Almost surely, 211012211021131 is an apocalyptic number.
11012211021131 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012211021131 is an equidigital number, since it uses as much as digits as its factorization.
11012211021131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 11012211021131 its reverse (13112011221011), we get a palindrome (24124222242142).
The spelling of 11012211021131 in words is "eleven trillion, twelve billion, two hundred eleven million, twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •