Base | Representation |
---|---|
bin | 10101000011011101… |
… | …01101101100000011 |
3 | 1002011202011202021001 |
4 | 22201232231230003 |
5 | 141122121442011 |
6 | 5105341112431 |
7 | 550051365526 |
oct | 124156555403 |
9 | 32152152231 |
10 | 11303312131 |
11 | 4880474781 |
12 | 2235558717 |
13 | 10b1a14b97 |
14 | 7932a6bbd |
15 | 4625047c1 |
hex | 2a1badb03 |
11303312131 has 2 divisors, whose sum is σ = 11303312132. Its totient is φ = 11303312130.
The previous prime is 11303312093. The next prime is 11303312161. The reversal of 11303312131 is 13121330311.
11303312131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11303312131 - 29 = 11303311619 is a prime.
It is a super-2 number, since 2×113033121312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11303312099 and 11303312108.
It is not a weakly prime, because it can be changed into another prime (11303312161) 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, 5651656065 + 5651656066.
It is an arithmetic number, because the mean of its divisors is an integer number (5651656066).
Almost surely, 211303312131 is an apocalyptic number.
11303312131 is a deficient number, since it is larger than the sum of its proper divisors (1).
11303312131 is an equidigital number, since it uses as much as digits as its factorization.
11303312131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 11303312131 its reverse (13121330311), we get a palindrome (24424642442).
The spelling of 11303312131 in words is "eleven billion, three hundred three million, three hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •