Base | Representation |
---|---|
bin | 10100011111010100… |
… | …11110011010111101 |
3 | 1001101121211121212011 |
4 | 22033222132122331 |
5 | 140012023224013 |
6 | 5015312411221 |
7 | 536411152252 |
oct | 121752363275 |
9 | 31347747764 |
10 | 11000211133 |
11 | 473537248a |
12 | 216bb46b11 |
13 | 1063c9c792 |
14 | 764d27429 |
15 | 445ad1c3d |
hex | 28fa9e6bd |
11000211133 has 2 divisors, whose sum is σ = 11000211134. Its totient is φ = 11000211132.
The previous prime is 11000211119. The next prime is 11000211137. The reversal of 11000211133 is 33111200011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10253992644 + 746218489 = 101262^2 + 27317^2 .
It is an emirp because it is prime and its reverse (33111200011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11000211133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11000211137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500105566 + 5500105567.
It is an arithmetic number, because the mean of its divisors is an integer number (5500105567).
Almost surely, 211000211133 is an apocalyptic number.
It is an amenable number.
11000211133 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000211133 is an equidigital number, since it uses as much as digits as its factorization.
11000211133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 11000211133 its reverse (33111200011), we get a palindrome (44111411144).
The spelling of 11000211133 in words is "eleven billion, two hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •