Base | Representation |
---|---|
bin | 10101000100011010… |
… | …01110100111011001 |
3 | 1002012022020011002100 |
4 | 22202031032213121 |
5 | 141131143430241 |
6 | 5110224354013 |
7 | 550206363012 |
oct | 124215164731 |
9 | 32168204070 |
10 | 11311311321 |
11 | 4884a38682 |
12 | 2238175909 |
13 | 10b3585b2b |
14 | 79438a009 |
15 | 4630849b6 |
hex | 2a234e9d9 |
11311311321 has 12 divisors (see below), whose sum is σ = 16342543360. Its totient is φ = 7539036120.
The previous prime is 11311311299. The next prime is 11311311367. The reversal of 11311311321 is 12311311311.
11311311321 is a `hidden beast` number, since 1 + 1 + 31 + 1 + 311 + 321 = 666.
11311311321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11311311321 - 218 = 11311049177 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11311311294 and 11311311303.
It is not an unprimeable number, because it can be changed into a prime (11311310321) 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 in 11 ways as a sum of consecutive naturals, for example, 113665 + ... + 188526.
Almost surely, 211311311321 is an apocalyptic number.
It is an amenable number.
11311311321 is a deficient number, since it is larger than the sum of its proper divisors (5031232039).
11311311321 is a wasteful number, since it uses less digits than its factorization.
11311311321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306356 (or 306353 counting only the distinct ones).
The product of its digits is 54, while the sum is 18.
Adding to 11311311321 its reverse (12311311311), we get a palindrome (23622622632).
The spelling of 11311311321 in words is "eleven billion, three hundred eleven million, three hundred eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •