Base | Representation |
---|---|
bin | 101100100101001110110… |
… | …001001101101101100001 |
3 | 101211212202212101002000201 |
4 | 230211032301031231201 |
5 | 400143310100043423 |
6 | 10303225203545201 |
7 | 434224454404324 |
oct | 54451661155541 |
9 | 11755685332021 |
10 | 3063633206113 |
11 | a81309092317 |
12 | 41590468b201 |
13 | 192b8cbc559c |
14 | a83d01007bb |
15 | 54a5ae172ad |
hex | 2c94ec4db61 |
3063633206113 has 2 divisors, whose sum is σ = 3063633206114. Its totient is φ = 3063633206112.
The previous prime is 3063633206087. The next prime is 3063633206147. The reversal of 3063633206113 is 3116023363603.
3063633206113 is digitally balanced in base 2 and base 3, because in such bases 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., 2945026667664 + 118606538449 = 1716108^2 + 344393^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3063633206113 is a prime.
It is not a weakly prime, because it can be changed into another prime (3063633206213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1531816603056 + 1531816603057.
It is an arithmetic number, because the mean of its divisors is an integer number (1531816603057).
Almost surely, 23063633206113 is an apocalyptic number.
It is an amenable number.
3063633206113 is a deficient number, since it is larger than the sum of its proper divisors (1).
3063633206113 is an equidigital number, since it uses as much as digits as its factorization.
3063633206113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 104976, while the sum is 37.
Adding to 3063633206113 its reverse (3116023363603), we get a palindrome (6179656569716).
The spelling of 3063633206113 in words is "three trillion, sixty-three billion, six hundred thirty-three million, two hundred six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.240 sec. • engine limits •