Base | Representation |
---|---|
bin | 1011010000000100… |
… | …1100001110101001 |
3 | 21210111001121202212 |
4 | 2310001030032221 |
5 | 22141133223423 |
6 | 1215405334505 |
7 | 134562241133 |
oct | 26401141651 |
9 | 7714047685 |
10 | 3020211113 |
11 | 130a915347 |
12 | 703567435 |
13 | 39193ca8a |
14 | 209188053 |
15 | 12a237578 |
hex | b404c3a9 |
3020211113 has 2 divisors, whose sum is σ = 3020211114. Its totient is φ = 3020211112.
The previous prime is 3020211107. The next prime is 3020211127. The reversal of 3020211113 is 3111120203.
It is an a-pointer prime, because the next prime (3020211127) can be obtained adding 3020211113 to its sum of digits (14).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1872898729 + 1147312384 = 43277^2 + 33872^2 .
It is a cyclic number.
It is not a de Polignac number, because 3020211113 - 26 = 3020211049 is a prime.
It is not a weakly prime, because it can be changed into another prime (3020211163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1510105556 + 1510105557.
It is an arithmetic number, because the mean of its divisors is an integer number (1510105557).
Almost surely, 23020211113 is an apocalyptic number.
It is an amenable number.
3020211113 is a deficient number, since it is larger than the sum of its proper divisors (1).
3020211113 is an equidigital number, since it uses as much as digits as its factorization.
3020211113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 3020211113 is about 54956.4474197523. The cubic root of 3020211113 is about 1445.4811539288.
Adding to 3020211113 its reverse (3111120203), we get a palindrome (6131331316).
The spelling of 3020211113 in words is "three billion, twenty million, two hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •