Base | Representation |
---|---|
bin | 101101010011100000111… |
… | …100101100100111000101 |
3 | 102000122001100021112210201 |
4 | 231103200330230213011 |
5 | 402002100031030203 |
6 | 10342124425450501 |
7 | 440634141111436 |
oct | 55234074544705 |
9 | 12018040245721 |
10 | 3113330330053 |
11 | aa03a0897079 |
12 | 423474040a31 |
13 | 19777cc9b3b8 |
14 | aa98650d48d |
15 | 55eb8dd0e1d |
hex | 2d4e0f2c9c5 |
3113330330053 has 2 divisors, whose sum is σ = 3113330330054. Its totient is φ = 3113330330052.
The previous prime is 3113330330041. The next prime is 3113330330137. The reversal of 3113330330053 is 3500330333113.
3113330330053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3111579577089 + 1750752964 = 1763967^2 + 41842^2 .
It is a cyclic number.
It is not a de Polignac number, because 3113330330053 - 25 = 3113330330021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3113330330753) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1556665165026 + 1556665165027.
It is an arithmetic number, because the mean of its divisors is an integer number (1556665165027).
Almost surely, 23113330330053 is an apocalyptic number.
It is an amenable number.
3113330330053 is a deficient number, since it is larger than the sum of its proper divisors (1).
3113330330053 is an equidigital number, since it uses as much as digits as its factorization.
3113330330053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10935, while the sum is 28.
Adding to 3113330330053 its reverse (3500330333113), we get a palindrome (6613660663166).
The spelling of 3113330330053 in words is "three trillion, one hundred thirteen billion, three hundred thirty million, three hundred thirty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •