Base | Representation |
---|---|
bin | 10101000100011010… |
… | …01110101010010111 |
3 | 1002012022020011100101 |
4 | 22202031032222113 |
5 | 141131143432021 |
6 | 5110224354531 |
7 | 550206363403 |
oct | 124215165227 |
9 | 32168204311 |
10 | 11311311511 |
11 | 4884a38835 |
12 | 2238175a47 |
13 | 10b3585c46 |
14 | 79438a103 |
15 | 463084a91 |
hex | 2a234ea97 |
11311311511 has 2 divisors, whose sum is σ = 11311311512. Its totient is φ = 11311311510.
The previous prime is 11311311493. The next prime is 11311311559. The reversal of 11311311511 is 11511311311.
11311311511 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (11511311311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11311311511 - 213 = 11311303319 is a prime.
It is a super-2 number, since 2×113113115112 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11311411511) 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, 5655655755 + 5655655756.
It is an arithmetic number, because the mean of its divisors is an integer number (5655655756).
Almost surely, 211311311511 is an apocalyptic number.
11311311511 is a deficient number, since it is larger than the sum of its proper divisors (1).
11311311511 is an equidigital number, since it uses as much as digits as its factorization.
11311311511 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 45, while the sum is 19.
Adding to 11311311511 its reverse (11511311311), we get a palindrome (22822622822).
The spelling of 11311311511 in words is "eleven billion, three hundred eleven million, three hundred eleven thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •