Base | Representation |
---|---|
bin | 111000000010101001011… |
… | …011101101110001110001 |
3 | 111122011110002202102000022 |
4 | 320002221123231301301 |
5 | 1001044110111441423 |
6 | 12105104120133225 |
7 | 545143450016603 |
oct | 70025133556161 |
9 | 14564402672008 |
10 | 3851133312113 |
11 | 12552903a06aa |
12 | 522460907215 |
13 | 21c211291679 |
14 | d45782bd173 |
15 | 6a29bb41dc8 |
hex | 380a96edc71 |
3851133312113 has 2 divisors, whose sum is σ = 3851133312114. Its totient is φ = 3851133312112.
The previous prime is 3851133312041. The next prime is 3851133312163. The reversal of 3851133312113 is 3112133311583.
3851133312113 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., 2638782571489 + 1212350740624 = 1624433^2 + 1101068^2 .
It is a cyclic number.
It is not a de Polignac number, because 3851133312113 - 212 = 3851133308017 is a prime.
It is not a weakly prime, because it can be changed into another prime (3851133312163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1925566656056 + 1925566656057.
It is an arithmetic number, because the mean of its divisors is an integer number (1925566656057).
Almost surely, 23851133312113 is an apocalyptic number.
It is an amenable number.
3851133312113 is a deficient number, since it is larger than the sum of its proper divisors (1).
3851133312113 is an equidigital number, since it uses as much as digits as its factorization.
3851133312113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 19440, while the sum is 35.
Adding to 3851133312113 its reverse (3112133311583), we get a palindrome (6963266623696).
The spelling of 3851133312113 in words is "three trillion, eight hundred fifty-one billion, one hundred thirty-three million, three hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •