Base | Representation |
---|---|
bin | 10100101111001010… |
… | …00100100000111111 |
3 | 1001201212201121102221 |
4 | 22113211010200333 |
5 | 140300022341111 |
6 | 5040415030211 |
7 | 542613020011 |
oct | 122745044077 |
9 | 31655647387 |
10 | 11133012031 |
11 | 47a3327799 |
12 | 21a850b367 |
13 | 10856590ab |
14 | 7788161b1 |
15 | 4525b5371 |
hex | 29794483f |
11133012031 has 2 divisors, whose sum is σ = 11133012032. Its totient is φ = 11133012030.
The previous prime is 11133012001. The next prime is 11133012049. The reversal of 11133012031 is 13021033111.
11133012031 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 11133012031 - 223 = 11124623423 is a prime.
It is a super-2 number, since 2×111330120312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11133011996 and 11133012014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11133012001) 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, 5566506015 + 5566506016.
It is an arithmetic number, because the mean of its divisors is an integer number (5566506016).
Almost surely, 211133012031 is an apocalyptic number.
11133012031 is a deficient number, since it is larger than the sum of its proper divisors (1).
11133012031 is an equidigital number, since it uses as much as digits as its factorization.
11133012031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 11133012031 its reverse (13021033111), we get a palindrome (24154045142).
The spelling of 11133012031 in words is "eleven billion, one hundred thirty-three million, twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •