Base | Representation |
---|---|
bin | 10100100011000000… |
… | …11011101111001101 |
3 | 1001110210000121212102 |
4 | 22101200123233031 |
5 | 140042432230013 |
6 | 5022335244445 |
7 | 540235040666 |
oct | 122140335715 |
9 | 31423017772 |
10 | 11031133133 |
11 | 4750872659 |
12 | 217a379725 |
13 | 106a508317 |
14 | 76909636d |
15 | 44868dd58 |
hex | 29181bbcd |
11031133133 has 2 divisors, whose sum is σ = 11031133134. Its totient is φ = 11031133132.
The previous prime is 11031133103. The next prime is 11031133151. The reversal of 11031133133 is 33133113011.
11031133133 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 can be written as a sum of positive squares in only one way, i.e., 9462814729 + 1568318404 = 97277^2 + 39602^2 .
It is a cyclic number.
It is not a de Polignac number, because 11031133133 - 210 = 11031132109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11031133103) 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, 5515566566 + 5515566567.
It is an arithmetic number, because the mean of its divisors is an integer number (5515566567).
Almost surely, 211031133133 is an apocalyptic number.
It is an amenable number.
11031133133 is a deficient number, since it is larger than the sum of its proper divisors (1).
11031133133 is an equidigital number, since it uses as much as digits as its factorization.
11031133133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243, while the sum is 20.
Adding to 11031133133 its reverse (33133113011), we get a palindrome (44164246144).
The spelling of 11031133133 in words is "eleven billion, thirty-one million, one hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •