Base | Representation |
---|---|
bin | 1011010010011101… |
… | …0100001010110101 |
3 | 21211011212100221212 |
4 | 2310213110022311 |
5 | 22201213030414 |
6 | 1220403451205 |
7 | 135043214141 |
oct | 26447241265 |
9 | 7734770855 |
10 | 3030205109 |
11 | 1315520a48 |
12 | 706986b05 |
13 | 393a2b999 |
14 | 20a62a221 |
15 | 12b05d83e |
hex | b49d42b5 |
3030205109 has 2 divisors, whose sum is σ = 3030205110. Its totient is φ = 3030205108.
The previous prime is 3030205097. The next prime is 3030205111. The reversal of 3030205109 is 9015020303.
It is a happy number.
3030205109 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., 2529788209 + 500416900 = 50297^2 + 22370^2 .
It is a cyclic number.
It is not a de Polignac number, because 3030205109 - 216 = 3030139573 is a prime.
It is a Sophie Germain prime.
Together with 3030205111, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3030205159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1515102554 + 1515102555.
It is an arithmetic number, because the mean of its divisors is an integer number (1515102555).
Almost surely, 23030205109 is an apocalyptic number.
It is an amenable number.
3030205109 is a deficient number, since it is larger than the sum of its proper divisors (1).
3030205109 is an equidigital number, since it uses as much as digits as its factorization.
3030205109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 810, while the sum is 23.
The square root of 3030205109 is about 55047.2988347294. The cubic root of 3030205109 is about 1447.0737829744.
The spelling of 3030205109 in words is "three billion, thirty million, two hundred five thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •