Base | Representation |
---|---|
bin | 1001000011011111100… |
… | …11001010110111010101 |
3 | 1002202001000121200200212 |
4 | 10201233303022313111 |
5 | 20044130003031013 |
6 | 354531250215205 |
7 | 31322451446624 |
oct | 4415763126725 |
9 | 1082030550625 |
10 | 311113330133 |
11 | 10aa40400761 |
12 | 50367284505 |
13 | 234513862b8 |
14 | 110b50b36bb |
15 | 815d1876a8 |
hex | 486fccadd5 |
311113330133 has 2 divisors, whose sum is σ = 311113330134. Its totient is φ = 311113330132.
The previous prime is 311113330117. The next prime is 311113330141. The reversal of 311113330133 is 331033311113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 306746499409 + 4366830724 = 553847^2 + 66082^2 .
It is an emirp because it is prime and its reverse (331033311113) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 311113330133 - 24 = 311113330117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 311113330099 and 311113330108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (311113332133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155556665066 + 155556665067.
It is an arithmetic number, because the mean of its divisors is an integer number (155556665067).
Almost surely, 2311113330133 is an apocalyptic number.
It is an amenable number.
311113330133 is a deficient number, since it is larger than the sum of its proper divisors (1).
311113330133 is an equidigital number, since it uses as much as digits as its factorization.
311113330133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 729, while the sum is 23.
Adding to 311113330133 its reverse (331033311113), we get a palindrome (642146641246).
The spelling of 311113330133 in words is "three hundred eleven billion, one hundred thirteen million, three hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •