Base | Representation |
---|---|
bin | 101101010011010000010… |
… | …011101001110001110101 |
3 | 102000121022212220222022122 |
4 | 231103100103221301311 |
5 | 402001012042310333 |
6 | 10342041013405325 |
7 | 440624211023114 |
oct | 55232023516165 |
9 | 12017285828278 |
10 | 3113051135093 |
11 | aa0268232839 |
12 | 4233b6639845 |
13 | 1977371a6293 |
14 | aa95b3d3c7b |
15 | 55e9e631798 |
hex | 2d4d04e9c75 |
3113051135093 has 2 divisors, whose sum is σ = 3113051135094. Its totient is φ = 3113051135092.
The previous prime is 3113051135021. The next prime is 3113051135101. The reversal of 3113051135093 is 3905311503113.
3113051135093 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., 3112906221649 + 144913444 = 1764343^2 + 12038^2 .
It is a cyclic number.
It is not a de Polignac number, because 3113051135093 - 234 = 3095871265909 is a prime.
It is a super-2 number, since 2×31130511350932 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3113051135893) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1556525567546 + 1556525567547.
It is an arithmetic number, because the mean of its divisors is an integer number (1556525567547).
Almost surely, 23113051135093 is an apocalyptic number.
It is an amenable number.
3113051135093 is a deficient number, since it is larger than the sum of its proper divisors (1).
3113051135093 is an equidigital number, since it uses as much as digits as its factorization.
3113051135093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18225, while the sum is 35.
The spelling of 3113051135093 in words is "three trillion, one hundred thirteen billion, fifty-one million, one hundred thirty-five thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •